LeetCode 2Sum, 3Sum, 4Sum

two sum problem

three accepted solutions are provided here with decreased time complexity.

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> res;
#if 0
        for (int i = 0; i < nums.size() - 1; ++i) {
            for (int j = i + 1; j < nums.size(); ++j) {
                if (nums[i] + nums[j] == target) {
                    res.push_back(i);
                    res.push_back(j);
                    return res;
                }
            }
        }
#endif
#if 1
        unordered_map<int, int> hash;
        for (int i = 0; i < nums.size(); ++i) {
            hash.emplace(nums[i], i);
        }
        for (int i = 0; i < nums.size(); ++i) {
            if (hash.find(target - nums[i]) != hash.end()) {
                if (hash[target-nums[i]] != i) {
                    res.push_back(i);
                    res.push_back(hash[target-nums[i]]);
                    return res;
                }
            }
        }
#endif
        return res;
    }
};

three sum problem

sorted the vector firstly, then scan the vector, use the current number nums[i] as a pivot to try to find the complement value in the remaining vector. In this case the 3sum problem reduced to 2sum problem. One should be cautious to increase s and decrease t to remove duplication answers.

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> res;
        if (nums.size() < 3) return res;
        sort(nums.begin(), nums.end());
        for (int i = 0; i < nums.size() - 2; ++i) {
            if (i != 0 && nums[i] == nums[i-1]) continue;
            int s = i + 1, t = nums.size() - 1;
            while (s < t) {
                int sum = nums[i] + nums[s] + nums[t];
                if (sum == 0) {
                    res.push_back(vector<int>{nums[i], nums[s], nums[t]});
                    ++s; --t;
                    while (s < nums.size() && nums[s] == nums[s-1]) {
                        ++s;
                    }
                    while (t > 0 && nums[t] == nums[t+1]) {
                        --t;
                    }
                } else if (sum < 0) {
                    ++s;
                } else {
                    --t;
                }
            }
        }
        return res;
    }
};