leetcode 3Sum Closest

[hyponet]

https://leetcode.com/problems/3sum-closest/

找三个最接近的数求和

func threeSumClosest(nums []int, target int) int {
    sub := 65535
    ans := 0
    numsLen := len(nums)
    for i := 0; i < numsLen; i += 1 {
        for j := i + 1; j < numsLen; j += 1 {
            for l := j + 1; l < numsLen; l += 1 {
                sum := nums[i] + nums[j] + nums[l]
                tmp := 0
                if sum > target {
                    tmp = sum - target
                } else {
                    tmp = target - sum
                }
                if sub > tmp {
                    sub = tmp
                    ans = sum
                }
            }
        }
    }
    return ans
}