Given an array nums
of n integers, are there elements a, b, c in nums
such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note:
The solution set must not contain duplicate triplets.
Example:
Given array nums = [-1, 0, 1, 2, -1, -4], A solution set is: [ [-1, 0, 1], [-1, -1, 2] ]
解题思路:
2sum的思路:
1 : goal > left + right, left++;
2 : goal < left + right, right++;
3 ; goal == left + right, 找到目标数据
3sum思路:
先确定其中一个数据,另外两个按照2sum的思路做,需要注意去掉重复的数据。
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& num) {
vector<vector<int> > res;
std::sort(num.begin(), num.end());
for (int i = 0; i < num.size(); i++) {
int target = -num[i];
int front = i + 1;
int back = num.size() - 1;
while (front < back) {
int sum = num[front] + num[back];
// 按照2_sum的思路做
if (sum < target)
front++;
else if (sum > target)
back--;
else {
vector<int> triplet(3, 0);
triplet[0] = num[i];
triplet[1] = num[front];
triplet[2] = num[back];
res.push_back(triplet);
// 去掉重复的 triplet[1] ,顺便移动front
while (front < back && num[front] == triplet[1]) front++;
// 去掉重复的 triplet[2] ,顺便移动back
while (front < back && num[back] == triplet[2])back--;
}
}
// 去掉重复的 triplet[0] ,顺便移动i
while (i < (num.size()-1) && num[i + 1] == num[i])
i++;
}
return res;
}
};