Largest Perimeter Triangle Python Solution

lcpy gen -n 976   # by problem number
lcpy gen -s largest_perimeter_triangle   # by problem name

Input: nums = [2,1,2]
Output: 5
Explanation: You can form a triangle with three side lengths: 1, 2, and 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.

class Solution:
    # Time: O(n log n)
    # Space: O(1) (sort is in-place for this input list)
    def largest_perimeter(self, nums: list[int]) -> int:
        lengths = sorted(nums, reverse=True)
        for i in range(len(lengths) - 2):
            if lengths[i] < lengths[i + 1] + lengths[i + 2]:
                return lengths[i] + lengths[i + 1] + lengths[i + 2]
        return 0