给出一个有n个整数的数组S,在S中找到三个整数a, b, c,找到所有使得a + b + c = 0的三元组。
注意
在三元组(a, b, c),要求a <= b <= c。
结果不能包含重复的三元组。
样例
如S = {-1 0 1 2 -1 -4}, 你需要返回的三元组集合的是:
(-1, 0, 1)
(-1, -1, 2)
class Solution {
public:
/**
* @param numbers : Give an array numbers of n integer
* @return : Find all unique triplets in the array which gives the sum of zero.
*/
vector<vector<int> > threeSum(vector<int> &nums) {
// write your code here
vector<vector<int> > res;
int len = nums.size();
for (int i = 0; i < len; i++) {
for (int j = i+1; j < len; j++) {
for (int k = j+1; k <len; k++) {
if (nums[i]+nums[k]+nums[j] == 0) {
vector<int> result;
result.push_back(nums[i]);
result.push_back(nums[j]);
result.push_back(nums[k]);
for (int q = 0; q < 3; q++) {
for (int p = 0; p < 3; p++) {
if (result[q] < result[p]) {
swap(result[q], result[p]);
}
}
}
bool flag = false;
for (int t = 0; t < res.size(); t++) {
if (result == res[t])
flag = true;
}
if (flag == false)
res.push_back(result);
}
}
}
}
return res;
}
};