Golang Leecode 16. 3Sum Closest.go

版权声明：原创勿转 https://blog.csdn.net/anakinsun/article/details/89068709

思路

先排序，然后用两个指针遍历

code

func threeSumClosest(nums []int, target int) int {
	dist := math.MaxInt32
	ret := 0
	if len(nums) < 3 {
		return 0
	}
	sort.Ints(nums)
	l := len(nums)
	for i := 0; i < l-2; i++ {
		if i > 0 && nums[i] == nums[i-1] {
			continue
		}
		begin, end := i+1, l-1
		for begin < end {
			sum := nums[begin] + nums[end] + nums[i]
			if sum < target {
				if target-sum < dist {
					dist = target - sum
					ret = sum
				}
				begin++
			} else if sum > target {
				if sum-target < dist {
					dist = sum - target
					ret = sum
				}
				end--
			} else {
				return sum
			}
		}
	}
	return ret
}

更多内容请移步我的repo：https://github.com/anakin/golang-leetcode