LeetCode/15.cpp at main · vys1n/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
#include <vector>
#include <algorithm>
using namespace std;

class Solution {
public:
    vector<vector<int>> threesome(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<vector<int>> res = {};

        for(int i = 0; i < nums.size(); i++){
            if(nums[i] > 0) break;
            if(i > 0 && nums[i] == nums[i - 1]) continue;

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

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

        return res;
    }
};