Description
Given an array S of n integers, are there elements a, b, c in S 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]
]
Analyse
题意是在一个数组里找出所有的三元组,他们之和为0。题目意思比较的简单,直接暴力做,时间复杂度为 O ( n 3 ) O(n^3) O(n3),没试过,应该会出问题。可以考虑排序之后,然后挑出一个数,找出两个数之和为该数的相反数,找的过程可以用两头往中间找的方式。时间复杂度为 O ( n 2 ) O(n^2) O(n2)
Code
class Solution {
public:
vector<vector<int> > threeSum(vector<int>& nums) {
set<vector<int> > ans;
if (nums.size() < 3) return vector<vector<int> > (ans.begin(), ans.end());
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size() - 2; i++) {
int p = i + 1, q = nums.size() - 1;
while (p < q) {
int sum = nums[i] + nums[p] + nums[q];
if (sum == 0) {
vector<int> temp;
temp.push_back(nums[i]);
temp.push_back(nums[p]);
temp.push_back(nums[q]);
ans.insert(temp);
p++;
q--;
} else {
if (sum > 0) {
q--;
} else {
p++;
}
}
}
}
return vector<vector<int>> (ans.begin(), ans.end());
}
};