思路:借鉴三数之和的思想,先固定k,判断k和k-1是否相等,然后再按照三数之和思路固定i,用j和h作为left和right,根据sum值调整j和h。
public List<List<Integer>> fourSum(int[] nums, int target) {
List<List<Integer>> res=new LinkedList<>();
if(nums==null||nums.length<4) return res;
Arrays.sort(nums);
int len=nums.length;
long temp=0;
for(int k=0;k<len-3;k++) {
long min1=temp+nums[k]+nums[k+1]+nums[k+2]+nums[k+3];
if(min1>target) break;
long max1=temp+nums[k]+nums[len-3]+nums[len-2]+nums[len-1];
if(max1<target) continue;
if(k>0&&nums[k]==nums[k-1]) continue;
for(int i=k+1;i<len-2;i++){
if(i>k+1&&nums[i]==nums[i-1]) continue;
long min2=temp+nums[k]+nums[i]+nums[i+1]+nums[i+2];
if(min2>target) break;
long max2=temp+nums[k]+nums[i]+nums[len-2]+nums[len-1];
if(max2<target) continue;
int j=i+1;
int h=len-1;
while (j<h){
long sum=nums[k]+nums[i]+nums[j]+nums[h];
if(sum==target){
res.add(Arrays.asList(nums[k],nums[i],nums[j],nums[h]));
while(j<h&&nums[j]==nums[j+1]) j++;
while(j<h&&nums[h]==nums[h-1]) h--;
j++;
h--;
}
else if(sum<target) j++;
else h--;
}
}
}
return res;
}