812-Largest Triangle Area_812. largest triangle area-CSDN博客

本文介绍了一种求解平面上一系列点中能构成的最大三角形面积的方法。通过遍历所有可能的三点组合，利用坐标计算三角形面积，并找出最大值。适用于3到50个不重复的点，坐标范围在-50到50之间。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description:
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.

这里写图片描述

Note:

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.

问题描述:
在平面上你有一系列的点，返回可以由任意三个点构成的最大面积。

问题分析:
暴力破解就可以了，注意三点计算面积的公式:
$S=\frac{1}{2} * (x_1y_2+x_2y_3+x_3y_1 - x_1y_3 - x_2y_1 - x_3y_2)$

解法(brute force):

class Solution {
    public double largestTriangleArea(int[][] points) {
        int len = points.length;
        double maxArea = Integer.MIN_VALUE;

        for(int i = 0;i < len - 2;i++){
            for(int j = i + 1;j < len - 1;j++){
                for(int k = j + 1;k < len;k++){
                    maxArea = Math.max(maxArea, getArea(points[i], points[j], points[k]));
                }
            }
        }

        return maxArea;
    }
    public double getArea(int[] pointi, int[] pointj, int[] pointk){
        return Math.abs(((pointi[0] * pointj[1] + pointj[0] * pointk[1] + pointk[0] * pointi[1] - pointi[0] * pointk[1] - pointj[0] * pointi[1] - pointk[0] * pointj[1]) * 1.0) / 2.0);
    }
}