DSA/three-sum.cpp at main · anuuragg/DSA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        int target = 0;

        sort(nums.begin(), nums.end());

        vector<vector<int>> result;

        for(int i = 0; i < nums.size(); i++){

            if(i > 0 && nums[i] == nums[i-1]){
                continue;
            }

            int j = i+1;
            int k = nums.size() - 1;

            while(j < k){
                if(nums[i]+nums[j]+nums[k] < target){
                    j++;
                } else if (nums[i]+nums[j]+nums[k] > target){
                    k--;
                } else {
                    result.push_back({nums[i], nums[j], nums[k]});

                    while(j < k && nums[j] == nums[j+1]){
                        j++;
                    }

                    while(j < k && nums[k] == nums[k-1]){
                        k--;
                    }

                    j++;
                    k--;
                }
            }

        }

        return result;
    }
};