def largestPerimeter(self, nums: List[int]) -> int:

        nums.sort()

        m = 0

        while len(nums) > 2:

            m = max(m, sum(nums[-3:]) if nums[-3]+nums[-2] > nums[-1] else 0)

            nums.pop()

        return m

def largestPerimeter(self, nums: List[int]) -> int:

        nums.sort()

        m = 0

        while len(nums) > 2:

            m = max(m, sum(nums[-3:]) if nums[-3]+nums[-2] > nums[-1] else 0)

            nums.pop()

        return m

def largestPerimeter(self, nums: List[int]) -> int:

        nums.sort()

        m = 0

        while len(nums) > 2:

            m = max(m, sum(nums[-3:]) if nums[-3]+nums[-2] > nums[-1] else 0)

            nums.pop()

        return m

m = max(m, sum(nums[-3:]) if nums[-3]+nums[-2] > nums[-1] else 0)