lc-go/solutions/9/q976/solution.go

17 lines
353 B
Go

// Package q976 implements a solution for https://leetcode.com/problems/largest-perimeter-triangle/
package q976
import "slices"
func largestPerimeter(nums []int) int {
slices.Sort(nums)
for i := len(nums) - 1; i > 1; i-- {
if nums[i-1]+nums[i-2] > nums[i] {
return nums[i] + nums[i-1] + nums[i-2]
}
}
return 0
}
var _ = largestPerimeter