class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> res;
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size(); i++) {
if (i > 0 && (nums[i] == nums[i - 1])) {
continue;
}
for (int j = i + 1; j < nums.size(); j++) {
if (j > i + 1 && (nums[j] == nums[j - 1])) {
continue;
}
int left = j + 1;
int right = nums.size() - 1;
while (left < right) {
if (nums[i] + nums[j] < target - (nums[left] + nums[right])) {
left++;
while (left < right && (nums[left] == nums[left - 1])) {
left++;
}
} else if (nums[i] + nums[j] > target - ( nums[left] + nums[right])){
right--;
while (left < right && (nums[right] == nums[right + 1])) {
right--;
}
} else {
res.push_back(vector<int>{nums[i], nums[j], nums[left], nums[right]});
left++;
right--;
while (left < right && (nums[left] == nums[left - 1])) {
left++;
}
while (left < right && (nums[right] == nums[right + 1])) {
right--;
}
}
}
}
}
return res;
}
};
思路和三数之和一样,只是用了两个for循环,注意一下那个判断语句是nums[i] + nums[j] < nums[left] - nums[right],不能全都堆在左边,会溢出。