16.3-sum-closest.go

package leetcode

import (
	"math"
	"sort"
)

/*
 * @lc app=leetcode id=16 lang=golang
 *
 * [16] 3Sum Closest
 */

// @lc code=start
func threeSumClosest(nums []int, target int) int {
	sort.Ints(nums)
	ans := nums[0] + nums[1] + nums[2]

	for i := 0; i < len(nums); i++ {
		left, right := i+1, len(nums)-1
		for left < right {
			sum := nums[i] + nums[left] + nums[right]
			if math.Abs(float64(sum-target)) < math.Abs(float64(ans-target)) {
				ans = sum
			}

			if target < sum {
				right--
			} else if target > sum {
				left++
			} else {
				return ans
			}
		}
	}

	return ans
}

// @lc code=end