原题链接:812. 最大三角形面积
solution:
class Solution {
public:
double largestTriangleArea(vector<vector<int>>& points) {
int n = points.size(); //n个点
double res = 0 ; //定义返回值
for(int i = 0;i < n;i++)
for(int j = i + 1;j < n;j++)
for(int k = j + 1;k < n;k++) {
double a = sqrt(pow(points[i][0] - points[j][0], 2) + pow(points[i][1] - points[j][1], 2));
double b = sqrt(pow(points[i][0] - points[k][0], 2) + pow(points[i][1] - points[k][1], 2));
double c = sqrt(pow(points[j][0] - points[k][0], 2) + pow(points[j][1] - points[k][1], 2));
double s = (a + b + c) / 2;
res = max(res,sqrt(s * (s - a) * (s - b) * (s - c)));
}
return res;
}
};