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

**Example 2:**

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

**Output:** 0

**Constraints:**

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