题目:
You have a list of points in the plane. Return the area of the largest triangle that can be formed by any 3 of the points.
Example: Input: points = [[0,0],[0,1],[1,0],[0,2],[2,0]] Output: 2 Explanation: The five points are show in the figure below. The red triangle is the largest.
Notes:
3 <= points.length <= 50
.- No points will be duplicated.
-
-50 <= points[i][j] <= 50
. - Answers within
10^-6
of the true value will be accepted as correct.
代码:
class Solution {
public double largestTriangleArea(int[][] points) {
double max = 0;
for(int[] point1 : points){
for(int[] point2 : points){
for(int[] point3 : points){
max = Math.max(max, 0.5 * (point1[0]*point2[1]+point2[0]*point3[1]+point3[0]*point1[1] - point1[0]*point3[1]-point3[0]*point2[1]-point2[0]*point1[1]));
}
}
}
return max;
}
}