LeetCode Problems

3sum.cpp

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        set<vector<int> > st;
        sort(num.begin(), num.end());
        int i, j, k;
        int n = num.size();
        for (i = 0; i < n - 2; i++) {
            j = i+1;
            k = n-1;
            while (j < k) {
                int sum = num[i] + num[j] + num[k];
                if (sum == 0) {
                    vector<int> v;
                    v[0] = num[i];
                    v[1] = num[j];
                    v[2] = num[k];
                    rs.insert(v);
                    j++;
                    k--;
                } else if (sum > 0) {
                    k--;
                } else if (sum < 0) {
                    j++;
                }
            }
        }
        vector<vector <int> >result (st.begin(), st.end());
        return result;
    }
};