lc-go/solutions/9/q976/solution.go
2026-01-13 00:14:04 +09:00

16 lines
253 B
Go

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