• Home
• com.github.javadev
• leetcode-in-java11
• 1.19
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0801_0900.s0812_largest_triangle_area.readme.md Maven / Gradle / Ivy

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:**

![](https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/04/1027.png)

**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**.