leetcode812

class Solution
{
public:
    double largestTriangleArea(vector<vector<int>>& points)
    {
        double max_area = 0.0, area = 0.0;
        for (auto &p1 : points)
        {
            for (auto &p2 : points)
            {
                for (auto &p3 : points)
                {
                    area = abs(p1[0] * p2[1] + p2[0] * p3[1] + p3[0] * p1[1] - p2[0] * p1[1] - p3[0] * p2[1] - p1[0] * p3[1]) / 2.0;
                    max_area = max(max_area, area);
                }
            }
        }
        return max_area;
    }
};

这道题没什么思路，参照网上的答案，再此先做一个记录吧。

转载于:https://www.cnblogs.com/asenyang/p/9727957.html