LeetCode OJ - 3Sum Closest

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

    For example, given array S = {-1 2 1 -4}, and target = 1.

    The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

my answer(基于上题3 Sum思路):

import java.util.*;

public class Solution{
    public static int threeSumClosest(int[] nums, int target) {
    	
    	if(nums == null || nums.length<3)
    		return 0;
        if(nums.length==3)
            return nums[0]+nums[1]+nums[2];

    	Arrays.sort(nums);
        int sum = 0;
        int suml= Integer.MIN_VALUE;
        int sumr =Integer.MAX_VALUE;
        boolean flagl=false;
        boolean flagr=false;
    	for (int i=0;i<nums.length-2;i++){
    		if(i>1 && nums[i] == nums[i-1])
    			continue;
    		int l = i+1;
    		int r = nums.length-1;
    		
    		while(l<r){
    			sum = nums[i]+nums[l]+nums[r];
                System.out.println(sum+",i="+i+",l="+l+",r="+r);
    			if (sum == target)
                    return sum;
                else if(sum<target){
                    suml=(suml>sum)?suml:sum;
                    //System.out.println(suml);
    				l++;
                    flagl = true;
    			} else if(sum>target){
                    sumr=(sum<sumr)?sum:sumr;
                    //System.out.println(sumr);
    				r--;
                    flagr = true;
                } 
    		}
    	} 
        if(!(flagl & flagr))
            if(!flagl)
                return sumr;
            else if(!flagr)
                return suml;
        sum = ((target-suml)-(sumr-target))<0?suml:sumr;
        //System.out.println(sum);
        return sum;

    }

    public static void main(String[] args){
    	//int num =threeSumClosest(new int[]{-1,1,2,-4},1);
    	int num =threeSumClosest(new int[]{0,2,1,-3},1);
    	//int num =threeSumClosest(new int[]{1,1,-1},1);
    	//int num =threeSumClosest(new int[]{4,0,5,-5,3,3,0,-4,-5},-2);
        //int num =threeSumClosest(new int[]{1,1,1,1},0);
    	//int num =threeSumClosest(new int[]{82,-16,-60,-48,32,-30,0,-89,70,-46,-82,-58,66,41,-96,-55,-49,-87,-33,-65,9,14,81,-11,80,-93,79,-63,-61,-16,22,-31,75,12,17,-6,37,-2,-89,-66,3,-95,-74,58,-95,22,11,-20,-36,60,-75,46,-52,-61,-28,7,-50,-45,93,-91,-43,35,-99,-39,53,-54,-98,-4,13,-90,23,-4,-65,29,85,-76,-64,81,32,-97,51,12,-82,-31,81,-2,-83,-9,89,-37,-23,-66,-91,-15,-98,-74,94,30,-2,-70,13,19,-77,-42,33,-70,25,77,47,-70,-70,60,-63,-4,83,13,-78,-23,28,-86,-11,-16,-57,-84,51,-48,-63,-15,29,56,-25,73,-69,23,28,90,96,41,65,-22,-43,-68,-77,31,69,-84,23,-63,-18,20,-93,-17,-48,-73,14,-95,98,-64,-12,-45,14,7,51,-61,89,-48,-23,2,-56,84,-2,27,74,-39,-18,-65,79,-36,-76,-30,44,78,-76,37,88,0,32,55,-51,23,-9,68,26,15,66,66,-56,-42,56,28,33,-32,-23,-36,-12,-76,-12,42,12,40,69,54,82,-22,-7,46,-46},270);
    	System.out.println(num);
    }
}

Runtime：9ms

居然击败了93.88%，哇咔咔~~