comefrom: <doocs>0976.Largest Perimeter Triangle_1.py
code: def largestPerimeter( nums: List[int]) -> int:
      nums.sort()
      for i in range(len(nums) - 1, 1, -1):
          if (c := nums[i - 1] + nums[i - 2]) > nums[i]:
              return c + nums[i]
      return 0
masked: def sample_funcname ( var_0 : List [ int ] ) -> int :
      var_0.sort ( )
      for var_7 in range ( len ( var_0 ) - 1 , 1 , - 1 ) :
          if ( var_8 := var_0 [ var_7 - 1 ] + var_0 [ var_7 - 2 ] ) > var_0 [ var_7 ] :
              return var_8 + var_0 [ var_7 ]
      return 0
  