• Home
• com.github.javadev
• leetcode-in-kotlin
• 1.21
• 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.

g0901_1000.s0976_largest_perimeter_triangle.readme.md Maven / Gradle / Ivy

976\. Largest Perimeter Triangle

Easy

Given an integer array `nums`, return _the largest perimeter of a triangle with a non-zero area, formed from three of these lengths_. If it is impossible to form any triangle of a non-zero area, return `0`.

**Example 1:**

**Input:** nums = [2,1,2]

**Output:** 5

**Explanation:** You can form a triangle with three side lengths: 1, 2, and 2.

**Example 2:**

**Input:** nums = [1,2,1,10]

**Output:** 0

**Explanation:** 

You cannot use the side lengths 1, 1, and 2 to form a triangle. 

You cannot use the side lengths 1, 1, and 10 to form a triangle. 

You cannot use the side lengths 1, 2, and 10 to form a triangle. 

As we cannot use any three side lengths to form a triangle of non-zero area, we return 0.

**Constraints:**

*   3 <= nums.length <= 104
*   1 <= nums[i] <= 106