We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 933ca4a commit 94b0266Copy full SHA for 94b0266
cpp/15-3Sum.cpp
@@ -0,0 +1,31 @@
1
+class Solution {
2
+public:
3
+ vector<vector<int>> threeSum(vector<int>& nums) {
4
+ sort(nums.begin(), nums.end());
5
+ vector<vector<int>> res;
6
+ for (int i = 0; i < nums.size(); ++i) {
7
+ int a = nums[i];
8
+ // triplet should not contain duplicate elements
9
+ if (i > 0 && a == nums[i - 1])
10
+ continue;
11
+ // 2 ptr approach
12
+ int l = i + 1, r = nums.size() - 1;
13
+ while (l < r) {
14
+ int threeSum = a + nums[l] + nums[r];
15
+ if (threeSum > 0)
16
+ r -= 1;
17
+ else if (threeSum < 0)
18
+ l += 1;
19
+ else {
20
+ // found triplet
21
+ res.push_back({ a, nums[l], nums[r] });
22
23
+ // skip duplicates
24
+ while (nums[l] == nums[l - 1] && l < r)
25
26
+ }
27
28
29
+ return res;
30
31
+};
0 commit comments