具体思想:
剪枝去重dfs会爆;
两个循环嵌套,利用双指针搜索另外两层循环两个数;
注意以下几点:
1.循环也可剪枝,这个以前没看过:
2.注意下整数加和越界的问题;
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> ret;
if(nums.size()<4)
return ret;
sort(nums.begin(),nums.end());
int n=nums.size();
for(int i=0;i<nums.size()-3;i++){
if(i>0&&nums[i]==nums[i-1])
continue;
if((long)nums[i]+nums[i+1]+nums[i+2]+nums[i+3]>target)
continue;
for(int j=i+1;j<nums.size()-2;j++){
if(j>i+1&&nums[j]==nums[j-1])
continue;
if((long)nums[i]+nums[j+1]+nums[j+2]+nums[j]>target)
continue;
if((long)nums[i]+nums[j]+nums[n-2]+nums[n-1]<target)
continue;
long sum=nums[i]+nums[j];
int l=j+1;
int r=nums.size()-1;
while(l<r){
if(l>j+1&&nums[l]==nums[l-1]){
l++;
continue;
}
if(r<n-1&&nums[r]==nums[r+1]){
r--;
continue;
}
if((long)nums[l]+nums[r]+sum==target){
ret.push_back({nums[i],nums[j],nums[l],nums[r]});
l++;
}else if(nums[l]+nums[r]+sum>target){
r--;
}else{
l++;
}
}
}
}
return ret;
}
};