Largest Triangle Area LeetCode solution in Java

1
class Solution {
2
  public double largestTriangleArea(int[][] points) {
3
    double ans = 0;
4
    int n = points.length;
5
    for (int i = 0; i < n; i++) {
6
      for (int j = i + 1; j < n; j++) {
7
        for (int k = j + 1; k < n; k++) {
8
          ans =
9
              Math.max(
10
                  ans,
11
                  0.5
12
                      * Math.abs(
13
                          points[i][0] * (points[j][1] - points[k][1])
14
                              + points[j][0] * (points[k][1] - points[i][1])
15
                              + points[k][0] * (points[i][1] - points[j][1])));
16
        }
17
      }
18
    }
19
    return ans;
20
  }
21
}