# [Leetcode]16. 3Sum Closest

Time：2019-12-2

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).
Similar to the previous question, you can use two pointers to avoid useless judgment

``````public int threeSumClosest(int[] nums, int target) {
if(nums==null || nums.length<3) return 0;
Arrays.sort(nums);
int ret=nums[0]+nums[1]+nums[2];
for(int i=0;i<nums.length-2;i++){
if(i>0 && nums[i]==nums[i-1]) continue;
int left=i+1;
int right=nums.length-1;
while(right>left){
if(left>i+1 && nums[left]==nums[left-1]){
left++;
continue;
}
if(right<nums.length-1 && nums[right]==nums[right+1]){
right--;
continue;
}
int sum=nums[i]+nums[left]+nums[right];
int diff=sum-target;
if(diff==0) return sum;
else{
if(Math.abs(diff)<Math.abs(ret-target)) ret=sum;
if(diff<0) left++;
else right--;
}
}
}
return ret;
}``````

## More complete common architecture design ideas

1、 MPP architecture 1. Basic concepts of MPP architecture MPP (Massively Parallel In the non shared database cluster, each node has its own disk storage system and memory system. The business data is divided into each node according to the database model and application characteristics. Each data node is connected to each other through a […]