基本和3sum 差不多,都是双指针,只不过多了一层循环,所以算法时间复杂度是o(n3), 空间复杂度是O(1).
vector<vector<int>> fourSum(vector<int>& nums, int target) {
if(nums.size() < 4) return {};
vector<vector<int>> k;
sort(nums.begin(), nums.end());
int start(0), end(0);
for(int i = 0 ; i < nums.size() - 3; i++){
for(int j = i + 1; j < nums.size() - 2; j++){
start = j + 1; end = nums.size() -1;
while(start < end){
int tmp = nums[i] + nums[j] + nums[start] + nums[end];
if(tmp == target) {
k.push_back({nums[i], nums[j], nums[start], nums[end]});
//判重。
while(start < end && nums[end-1] == nums[end]) end--;
while(start < end && nums[start+1] == nums[start]) start++;
while(j < nums.size() - 2 && nums[j+1] == nums[j]) j++;
while(i < nums.size() - 3 && nums[i+1] == nums[i]) i++;
end--;
start++;
}
else if(tmp < target) start++;
else end--;
//if(end == 0 || start == nums.size() -1 ) break;
}
}
}
return k;
}
};