问题原文点击打开链接
问题难度easy,代码如下
public double area(int[] x,int[] y,int[] z){
return 0.5*(x[0]*y[1]+y[0]*z[1]+z[0]*x[1]-x[0]*z[1]-y[0]*x[1]-z[0]*y[1]);
}
public double largestTriangleArea(int[][] points) {
double res = 0;
for (int i = 0;i<points.length;i++){
for (int j = 0;j<points.length;j++){
if (i == j) continue;
for (int k = j+1;k<points.length;k++){
if (k == i||k == j) continue;
double tmp = area(points[i],points[j],points[k]);
res = res < tmp ? tmp : res;
}
}
}
return res;
}