976. Largest Perimeter Triangle

https://leetcode.com/problems/largest-perimeter-triangle/

Python

class Solution:
    def largestPerimeter(self, nums: List[int]) -> int:
        nums.sort(reverse=True)
        for i in range(len(nums)-2):
            if nums[i+1] + nums[i+2] > nums[i]:
                return nums[i+1] + nums[i+2] + nums[i]
        return 0

Go

import "sort"


func largestPerimeter(nums []int) int {
    sort.Sort(sort.Reverse(sort.IntSlice(nums)))
    for i:=0 ; i<len(nums)-2 ; i++ {
        if nums[i+1] + nums[i+2] > nums[i] {
            return nums[i] + nums[i+1] + nums[i+2]
        }
    }
    return 0
}