1. 两数之和

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        map<int, int> m;
        for(int i = 0; i < nums.size(); i++){
            if(m.find(target-nums[i]) != m.end()) // ***
                return {m[target-nums[i]], i};
            m[nums[i]] = i;
        }
        return {};
    }
};

15. 三数之和

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> res;
        int n = nums.size(), l, r, val;
        sort(nums.begin(), nums.end());
        for(int i = 0; i < n-2; i++){
            if(nums[i] > 0) break;
            if(i && nums[i] == nums[i-1]) continue;
            l = i+1;
            r = n-1;
            val = 0-nums[i];
            while(l<r){
                if(nums[l]+nums[r] == val){
                    vector<int> v = {nums[i], nums[l++], nums[r--]};
                    res.push_back(v);
                    while(nums[l]==nums[l-1] && l<r) l++;
                    while(nums[r]==nums[r+1] && l<r) r--;
                }
                else if(nums[l]+nums[r] < val) l++;
                else r--;
            }
        }
        return res;
    }
};

16. 最接近的三数之和

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        int n = nums.size(), sum, l, r;
        sort(nums.begin(), nums.end());
        for(int i = 0; i < n; i++){
            l = i+1;
            r = n-1;
            while(l < r){
                int temp = nums[i]+nums[l]+nums[r];
                if(abs(target-temp) < abs(target-sum)) sum = temp;
                if(temp == target) return sum;
                else if(temp < target) l++;
                else r--;
            }
        }
        return sum;
    }
};

18. 四数之和

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<vector<int>> res;
        sort(nums.begin(), nums.end());
        int n = nums.size(), a, b, l, r;
        for(int i = 0; i < n-3; i++){
            if(i && nums[i] == nums[i-1]) continue;
            a = target - nums[i];
            for(int j = i+1; j < n-2; j++){
                if(j > i+1 && nums[j] == nums[j-1]) continue;
                b = a - nums[j];
                l = j+1;
                r = n-1;
                while(l<r){
                    if(nums[l]+nums[r] == b){
                        vector<int> v = {nums[i], nums[j], nums[l], nums[r]};
                        res.push_back(v);
                        while(l < r && nums[++l] == nums[l-1]);
                        while(l < r && nums[--r] == nums[r+1]);
                    }
                    else if(nums[l]+nums[r] < b) l++;
                    else r--;
                }
            }
        }
        return res;
    }
};

167. 两数之和 II - 输入有序数组

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        vector<int> res(2);
        int i = 0, j = numbers.size()-1, sum;
        while(i < j){
            sum = numbers[i] + numbers[j];
            if(sum == target) break;
            else if(sum < target)
                i++;
            else
                j--;
        }
        res[0] = i+1;
        res[1] = j+1;
        return res;
    }
};