LeetCode 812. 最大三角形面积

最新推荐文章于 2024-09-25 16:05:14 发布

Sasakihaise_

最新推荐文章于 2024-09-25 16:05:14 发布

阅读量2.1k

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/Sasakihaise_/article/details/124781552

版权

LeetCode 专栏收录该内容

438 篇文章 1 订阅

订阅专栏

题目链接：

力扣https://leetcode.cn/problems/largest-triangle-area/

【方法一海伦公式】p = (a + b + c) / 2, s = sqrt(p * ( p - a) * ( p - b ) * ( p - c ))

class Solution {
    public double largestTriangleArea(int[][] points) {
        int n = points.length;
        int i, j, k;
        double ans = 0;
        int x1, y1, x2, y2, x3, y3;
        for(i = 0; i < n; i++){
            for(j = i + 1; j < n; j++){
                for(k = j + 1; k < n; k++){
                    x1 = points[i][0]; y1 = points[i][1];
                    x2 = points[j][0]; y2 = points[j][1];
                    x3 = points[k][0]; y3 = points[k][1];
                    if((x1 - x2) * (y1 - y3) != (x1 - x3) * (y1 - y2)){
                        double a = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
                        double b = Math.sqrt((x1 - x3) * (x1 - x3) + (y1 - y3) * (y1 - y3));
                        double c = Math.sqrt((x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3));
                        double p = (a + b + c) / 2;
                        double s = Math.sqrt(p * (p - a) * (p - b) * (p - c));
                        ans = Math.max(ans, s);
                    }
                }
            }
        }
        return ans;
    }
}

【方法二向量点乘】三个顶点分别是(x1, y1) (x2, y2) (x3, y3)可以组成的两个向量为(x1 - x2, y1 - y2) (x1 - x3, y1 - y3)这两个向量叉乘的结果就是由这两个向量组成的平行四边形的面积，/2就是三角形的面积。

叉乘的计算公式如下：(x1, y1) ✖️ (x2, y2) = x1 * y2 - y1 * x2

class Solution {
    public double largestTriangleArea(int[][] points) {
        int n = points.length;
        double ans = 0;
        for(var i = 0; i < n; i++){
            for(var j = i + 1; j < n; j++){
                for(var k = j + 1; k < n; k++){
                    var x1 = points[i][0] - points[j][0];
                    var y1 = points[i][1] - points[j][1];
                    var x2 = points[i][0] - points[k][0];
                    var y2 = points[i][1] - points[k][1];
                    ans = Math.max(ans, Math.abs(x1 * y2 - x2 * y1) / 2.0);
                }
            }
        }
        return ans;
    }
}