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

class Solution:
    def largestPerimeter(self, nums: List[int]) -> int:
        nums = sorted(nums)[::-1]
        for index in range(len(nums)-2):
            if nums[index] < nums[index+1] + nums[index+2]:
                return nums[index] + nums[index+1] + nums[index+2]
        return 0