class Solution {
public:
double largestTriangleArea(vector<vector<int>>& points) {
double res = DBL_MIN;
for(int i = 0; i < points.size() - 2; i++)
{
for(int j = i + 1; j < points.size() - 1; j++)
{
for(int k = j + 1; k < points.size(); k++)
{
double AB = sqrt(pow(points[i][0] - points[j][0],2)+pow(points[i][1] - points[j][1],2));
double AC = sqrt(pow(points[i][0] - points[k][0],2)+pow(points[i][1] - points[k][1],2));
double BC = sqrt(pow(points[j][0] - points[k][0],2)+pow(points[j][1] - points[k][1],2));
double p = (AB + AC + BC) / 2;
double s = sqrt(p * (p - AB) * (p - AC) * (p - BC));
res = max(res, s);
}
}
}
return res;
}
};
参考链接:https://baike.baidu.com/item/%E6%B5%B7%E4%BC%A6%E5%85%AC%E5%BC%8F