1. func abs(num int) int {
    2.     if num < 0 {
    3.         return -num
    4.     }
    5.     return num
    6. }
    8. func threeSumClosest(nums []int, target int) int {
    9.     result := nums[0] + nums[1] + nums[2]
    10.     last_offset := abs(target - result)
    12.     sort.Ints(nums)
    14.     for i := 0; i < (len(nums) - 2); i++ {
    15.         l := i + 1
    16.         h := len(nums) - 1
    18.         sum := 0
    19.         for l < h {
    20.             sum = nums[i] + nums[l] + nums[h]
    21.             offset := abs(sum - target)
    22.             if offset < last_offset {
    23.                 result = sum
    24.                 last_offset = offset
    25.             }
    27.             if sum < target {
    28.                 l++
    29.             } else if sum > target {
    30.                 h--
    31.             } else {
    32.                 break
    33.             }
    34.         }
    35.     }
    37.     return result
    38. }
    40. func main() {
    41.     //fmt.Println(threeSumClosest([]int{-1, 2, 1, -4}, 1))
    42.     fmt.Println(threeSumClosest([]int{1, 2, 5, 10, 11}, 12))
    43. }