|
| 1 | +<h2><a href="https://leetcode.com/problems/largest-triangle-area">Largest Triangle Area</a></h2> <img src='https://img.shields.io/badge/Difficulty-Easy-brightgreen' alt='Difficulty: Easy' /><hr><p>Given an array of points on the <strong>X-Y</strong> plane <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code>, return <em>the area of the largest triangle that can be formed by any three different points</em>. Answers within <code>10<sup>-5</sup></code> of the actual answer will be accepted.</p> |
| 2 | + |
| 3 | +<p> </p> |
| 4 | +<p><strong class="example">Example 1:</strong></p> |
| 5 | +<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/04/1027.png" style="height: 369px; width: 450px;" /> |
| 6 | +<pre> |
| 7 | +<strong>Input:</strong> points = [[0,0],[0,1],[1,0],[0,2],[2,0]] |
| 8 | +<strong>Output:</strong> 2.00000 |
| 9 | +<strong>Explanation:</strong> The five points are shown in the above figure. The red triangle is the largest. |
| 10 | +</pre> |
| 11 | + |
| 12 | +<p><strong class="example">Example 2:</strong></p> |
| 13 | + |
| 14 | +<pre> |
| 15 | +<strong>Input:</strong> points = [[1,0],[0,0],[0,1]] |
| 16 | +<strong>Output:</strong> 0.50000 |
| 17 | +</pre> |
| 18 | + |
| 19 | +<p> </p> |
| 20 | +<p><strong>Constraints:</strong></p> |
| 21 | + |
| 22 | +<ul> |
| 23 | + <li><code>3 <= points.length <= 50</code></li> |
| 24 | + <li><code>-50 <= x<sub>i</sub>, y<sub>i</sub> <= 50</code></li> |
| 25 | + <li>All the given points are <strong>unique</strong>.</li> |
| 26 | +</ul> |
0 commit comments