Largest Perimeter Triangle LeetCode solution in Python

1
class Solution:
2
    def largestPerimeter(self, nums: List[int]) -> int:
3
        nums = sorted(nums, reverse=True)
4
        l = len(nums)
5
        for i in range(l - 2):
6
            if (
7
                nums[i] < nums[i + 1] + nums[i + 2]
8
            ):  # condition if triangle can be formed
9
                return nums[i] + nums[i + 1] + nums[i + 2]
10
        return 0