Package g0801_0900.s0812_largest_triangle_area

Class Solution

java.lang.Object

g0801_0900.s0812_largest_triangle_area.Solution

public class Solution
extends Object

812 - Largest Triangle Area\. Easy Given an array of points on the **X-Y** plane `points` where points[i] = [xi, yi], return _the area of the largest triangle that can be formed by any three different points_. Answers within 10-5 of the actual answer will be accepted. **Example 1:**  **Input:** points = \[\[0,0],[0,1],[1,0],[0,2],[2,0]] **Output:** 2.00000 **Explanation:** The five points are shown in the above figure. The red triangle is the largest. **Example 2:** **Input:** points = \[\[1,0],[0,0],[0,1]] **Output:** 0.50000 **Constraints:** * `3 <= points.length <= 50` * -50 <= xi, yi <= 50 * All the given points are **unique**.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
double	largestTriangleArea(int[][] points)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

largestTriangleArea

public double largestTriangleArea(int[][] points)