說明

使用蠻力法，把所有點遍歷一遍，找到最小

#include<iostream>
#include<iomanip>
using namespace std;
struct Point
{
	double x, y;
}point[1000];

int main()
{
	double min = 99999999;
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> point[i].x >> point[i].y;
	for (int i = 0; i < n-1; i++)
	{
		for (int j = i+1; j < n; j++)
		{
			double d = sqrt((point[j].x - point[i].x)*(point[j].x - point[i].x) +
				(point[j].y - point[i].y)*(point[j].y - point[i].y));
			if (d < min)
				min = d;
		}
	}
	cout <<min << endl;
    return 0;
}

 

歡迎關注本人微信公眾號，更好技術和行業好文等您收看！