解法一:二重循环,算法复杂度O(n2)。
int GetMaxSlope(vector<Point> &points, int &i, int &j)
{
if (points.empty() || points.size()==1)
{
i = -1;
j = -1;
return -1;
}
if (points.size()==2)
{
i = 0;
j = 1;
return 0;
}
double fCurSlope = 0;
double fMaxSlope = (points[0].y -