luoheng
10/12/2019 - 11:23 AM

largestPerimeter


import "sort"

func largestPerimeter(A []int) int {
    sort.Ints(A)
    a, b, c := A[len(A)-3], A[len(A)-2], A[len(A)-1]
    for i := len(A) - 4; i >= 0; i-- {
        if a + b > c {
            break
        }
        a, b, c = A[i], a, b
    }
    if a + b > c {
        return a + b + c
    }
    return 0
}