leetcode--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).

[java] view plain copy

1. public class Solution {  
2.     public int threeSumClosest(int[] nums, int target) {  
3.         int result = nums[0]+nums[1]+nums[2];  
4.         Arrays.sort(nums);        
5.         for(int i=0;i<nums.length;i++){    
6.             int low = i+1;  
7.             int high = nums.length-1;             
8.             while(low<high){  
9.                 if(Math.abs(nums[low]+nums[high]+nums[i]-target)<Math.abs(result-target)){  
10.                     result = nums[low]+nums[high]+nums[i];  
11.                 }  
12.                 if(nums[low]+nums[high]==target-nums[i]){                         
13.                     return target;  
14.                 }else if(nums[low]+nums[high]<target-nums[i]){  
15.                     low++;  
16.                 }else{  
17.                     high--;  
18.                 }                 
19.             }                     
20.         }         
21.         return result;  
22.     }  
23. }  

原文链接http://blog.csdn.net/crazy__chen/article/details/45506191