3Sum Closest 2021-03-03 06:10

Problem Description

public static int threeSumClosest(int[] nums, int target) {
    Arrays.sort(nums);
    int L;
    int R;
    int minGap = Integer.MAX_VALUE;
    boolean isBiggerThanZero = false;
    for (int i = 0; i < nums.length; i++) {
        if (i > 0 && nums[i] == nums[i - 1]) {
            continue;
        }
        L = i + 1;
        R = nums.length - 1;
        while (L < R) {
            int sum = nums[i] + nums[L] + nums[R];
            int gap = sum - target;
            if (gap == 0) {
                return sum;
            } else if (gap > 0) {
                if(gap<minGap){
                    minGap=gap;
                    isBiggerThanZero = true;
                }
                R--;
            } else {
                if(-gap<minGap){
                    minGap=-gap;
                    isBiggerThanZero = false;
                }
                L++;
            }
        }
    }
    if (isBiggerThanZero) {
        return minGap + target;
    } else {
        return -minGap + target;
    }
}

henryxi leetcode list

EOF