问题描述
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.
For example, given array S = [-1, 0, 1, 2, -1, -4], A solution set is: [ [-1, 0, 1], [-1, -1, 2] ]
解题思路
先对数组排序,然后遍历数组时固定一个元素,取该元素后一个元素和最后一个元素为头指针位置和尾指针位置,根据这三个元素和的大小来移动头尾指针即可。
代码如下
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
int vsize = nums.size();
vector<vector<int>> doubleVec;
if (vsize < 3) return doubleVec;
sort(nums.begin(), nums.begin() + vsize);
for (int i = 0; i < vsize - 2; i++) {
if (nums[i] > 0) break;
if(i > 0 && nums[i] == nums[i-1]) continue;
int j = i + 1, k = vsize - 1;
while (j < k) {
if (nums[i] + nums[j] + nums[k] == 0) {
vector<int> vec;
vec.push_back(nums[i]);
vec.push_back(nums[j]);
vec.push_back(nums[k]);
doubleVec.push_back(vec);
j++; k--;
while (j < k && nums[j] == nums[j - 1]) j++;
while (j < k && nums[k] == nums[k + 1]) k--;
}
if (nums[i] + nums[j] + nums[k] < 0) {
j++;
continue;
}
if (nums[i] + nums[j] + nums[k] > 0) {
k--;
continue;
}
}
}
return doubleVec;
}
};