无论是4 sum还是 3sum都是一样的问题,本质上都是双指针的问题:
3 sum是固定一个数,剩下来的双指针;
4sum是固定两个两个数,剩下来的双指针;
关于预处理排序我之前见过另外一道题,是3个长度为N的序列,从三个序列中分别选一个数,使其相加为0。可以保证 N^2的复杂度。也是对其中两个先排序,然后可以算出一张表格,呈从上到下,从左到右的增加。那么查找的时候至多 2 * N步。
哎,这种题目就和高中的列项求和一样,没人教大概永远都不会,但只要有人教我一道,我TM能做100道- - 好无聊哦。
题目:
Given an array nums
of n integers and an integer target
, are there elements a, b, c, and d in nums
such that a + b + c + d = target
? Find all unique quadruplets in the array which gives the sum of target
.
Note:
The solution set must not contain duplicate quadruplets.
Example
Given array nums = [1, 0, -1, 0, -2, 2], and target = 0. A solution set is: [ [-1, 0, 0, 1], [-2, -1, 1, 2], [-2, 0, 0, 2] ]
AC代码:
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
int i, j, front, back;
vector< vector<int> > res;
int len = nums.size();
sort(nums.begin(), nums.end()); //sort first
for(i = 0; i < len-3; i++){ //一开始先固定俩
for(j = i + 1; j < len-2; j++){
int temp = nums[i] + nums[j];
front = j +1;
back = len -1;
while(front < back){
if(temp + nums[front] + nums[back] < target)
front++;
else if(temp + nums[front] + nums[back] > target)
back--;
else{
vector< int > v0;
v0.push_back(nums[i]);
v0.push_back(nums[j]);
v0.push_back(nums[front]);
v0.push_back(nums[back]);
res.push_back(v0);
while(nums[front] == nums[front+1]) //four while loop guarantees no duplicate!!
front++;
while(nums[back] == nums[back-1])
back--;
front++; back--; //Don't forget this!!
}
}
while(nums[j] == nums[j+1]) //four while loop guarantees no duplicate!!
j++;
}
while(nums[i] == nums[i+1]) //four while loop guarantees no duplicate!!
i++;
}
return res;
}
};