Week7: 3Sum
Difficulty:Medium
1.Problem
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]
]
2.Algorithm
1.首先,对input进行排序
2.然后,遍历所有可能作为三个数之中的第一个数的元素。
3.对于每一个2步骤中的元素,对其后面的元素进行双向遍历以查找符合条件的元素,同时也进行了去除一些重复数字的工作
3.Solution
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
int n = nums.size();
sort(nums.begin(),nums.begin()+n);
vector<vector<int>> result;
for(int i = 0; i < n - 2; i++) {
if(i > 0 && nums[i] == nums[i-1]) {
continue;
}
int start = i + 1;
int end = n - 1;
while(start < end) {
if(nums[i]+nums[start]+nums[end] == 0) {
vector<int> temp;
temp.push_back(nums[i]);
temp.push_back(nums[start]);
temp.push_back(nums[end]);
result.push_back(temp);
while(start < end && nums[start] == nums[start+1]) start++;
while(start < end && nums[end] == nums[end-1]) end--;
start++;
end--;
}
else if(nums[i]+nums[start]+nums[end] < 0) start++;
else end--;
}
}
return result;
}
};