class Solution {
public static List<List<Integer>> fourSum(int[] nums,int target){
List<List<Integer>>result=new ArrayList();
if(nums.length<4)return result;
Arrays.parallelSort(nums);
int l,r,num=nums.length;
for(int i=0;i<num-3;i++)
{
if(i>0&&nums[i]==nums[i-1])continue;
if(nums[i]+nums[i+1]+nums[i+2]+nums[i+3]>target)break;
if(nums[i]+nums[num-1]+nums[num-2]+nums[num-3]<target)continue;
for(int j=i+1;j<num-2;j++)
{
if(j-1>i&&nums[j]==nums[j-1])continue;
if(nums[i]+nums[j]+nums[j+1]+nums[j+2]>target)break;
if(nums[i]+nums[j]+nums[num-1]+nums[num-2]<target)continue;
l=j+1;
r=num-1;
while(l<r)
{
if(nums[i]+nums[j]+nums[l]+nums[r]==target)
{
result.add(Arrays.asList(nums[i],nums[j],nums[l],nums[r]));
while(l<r&&nums[l]==nums[l+1])l++;
while(l<r&&nums[r]==nums[r-1])r--;
l++;
r--;
}
else if(nums[i]+nums[j]+nums[l]+nums[r]<target)l++;
else r--;
}
}
}return result;
}
}
这代码实在是太完美了,我找不出任何改进的地方哈哈哈,吹一波自己写的代码。