#16 3Sum Closest

Description

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Example

Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

解题思路

hmmmmm其实就是承接3Sum，没有新的东西，把==换成abs求小的那个就好

class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int sum;
        int temp;
        int length = nums.length;
        int i, left_p, right_p;
        int a, b, c, a_ = 999999;
        sum = temp = target + 99999;
        Arrays.sort(nums);
        for(i = 0 ;i < length - 2; i++){
            a = nums[i];
            if(i > 0)
                a_ = nums[i - 1];
            if(a == a_)
                continue;
            left_p = i + 1;
            right_p = length - 1;
            while(left_p < right_p){
                b = nums[left_p];
                c = nums[right_p];
                temp = a + b + c;
                if(temp == target)
                    return target;
                if(Math.abs(target - temp) < Math.abs(target - sum)){
                    sum = temp;
                }
                if(temp > target){
                    right_p --;
                }
                else
                    left_p ++;
            }
        }
        return sum;
    }
}

其他

• 最短的一篇了叭hhhhhhh
• 其实一开始直接写sum = target + 99999的时候有点慌，万一他卡在target = MAX_INT就会报错了，结果没有，省去了解决这个问题的烦恼ww