Leetcode/leetcode at main · ksaini-web/Leetcode · 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
class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {

        int n=nums.size();

        vector<vector<int>>ans;

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

        for(int i=0;i<=n-2;i++){

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

            int k=n-1;
            int j=i+1;

            while(j<k){

                int sum=nums[i]+nums[j]+nums[k];

                if(sum<0){
                    j++;
                }
                else if(sum>0){
                    k--;
                }
                else{
                    ans.push_back({nums[i],nums[j],nums[k]});
                    j++;
                    k--;
  while(j<k&&nums[j]==nums[j-1]){j++;}
  while(k>j&&nums[k]==nums[k+1]){k--;}
                }

            }
        }

        return ans;

    }
};