C++ Two Sum;Three Sum; FourSum--在数组中找两数/三数/四数之和为固定值

首先，本篇解决的问题采用两个指针方法的均假设数组有序的前提下，如果无序，则先通过排序算法使数组有序。

1. Two Sum 问题
可以通过map解决，

vector<int> twoSum(vector<int> &nums, int target) {
    vector<int> v;
    map<int, int> hash;
    for (int i = 0; i < nums.size(); i++) {
        
        int remain = target - nums[i];
        if (hash.find(nums[i]) != hash.end()) {
            v.push_back(hash[nums[i]]);
            v.push_back(i);
            hash.erase(nums[i]);
        }
        hash[remain] = i;
    }
    return v;
}

也可以通过两个指针从头尾元素两边逐渐向中间寻找，即，
在头指针＜尾指针的前提下：
当前目标值＜头尾两元素之和：尾指针前移一位
当前目标值＞头尾两元素之和：头指针后移一位
当前目标值＝头尾两元素之和：记录下标

vector<int> twoSum1(vector<int> &nums, int target) {
    vector<int> v;
    int j = 0;
    int k = (int)nums.size()-1;
    while (j < k) {
        if (nums[j] == nums[j+1]) {
            j++;
        }
        else if (nums[k] == nums[k-1]) {
            k--;
        }
        int temp = nums[j] +nums[k];
        if (temp < target) {
            j++;
        }
        else if (temp > target) {
            k--;
        }
        else {
            v.push_back(j);
            v.push_back(k);
            j++;
        }
    }
    return v;
}

2. Three Sum 问题
通过固定一个指针后，另外两个指针从数组中剩余的头尾元素两边逐渐向中间寻找

vector<int> threeSum(vector<int> &nums, int target) {
    vector<int> v;
    for (int i = 0; i < nums.size()-2; i++) {
        int remain = target-nums[i];
        int j = i+1;
        int k = (int)nums.size()-1;
        while (j < k) {
            if (nums[j] == nums[j+1]) {
                j++;
            }
            else if (nums[k] == nums[k-1]) {
                k--;
            }
            int temp = nums[j] +nums[k];
            if (temp < remain) {
                j++;
            }
            else if (temp > remain) {
                k--;
            }
            else {
                v.push_back(i);
                v.push_back(j);
                v.push_back(k);
                j++;
            }
        }
    }
    return v;
}

3. FourSum 问题
通过固定两个个指针后，另外两个指针从数组中剩余的头尾元素两边逐渐向中间寻找

vector<int> fourSum(vector<int> &nums, int target) {
    vector<int> v;
    for (int i = 0; i < nums.size()-3; i++) {
        for (int f = i+1; f < nums.size()-2; f++) {
            int remain = target-nums[i]-nums[f];
            int j = f+1;
            int k = (int)nums.size()-1;
            while (j < k) {
                if (nums[j] == nums[j+1]) {
                    j++;
                }
                else if (nums[k] == nums[k-1]) {
                    k--;
                }
                int temp = nums[j] +nums[k];
                if (temp < remain) {
                    j++;
                }
                else if (temp > remain) {
                    k--;
                }
                else {
                    v.push_back(i);
                    v.push_back(f);
                    v.push_back(j);
                    v.push_back(k);
                    j++;
                }
            }
        }
    }
    return v;
}

4. main函数、输出

void printVector(vector<int> &nums, vector<int> &index, int n) {
    cout << n << "nums result is: " << endl;
    for (int i = 0; i < index.size(); i++) {
        cout << nums[index[i]];
        if ((i+1) % n == 0) {
            cout << endl;
        }
        else {
            cout << " & ";
        }
    }
}

int main() {
    vector<int> v1, v2, v3;
    vector<int> nums;
    for (int i = 1; i < 7; i++) {
        nums.push_back(i);
    }
    nums.push_back(6);
    
    v1 = twoSum(nums, 8);
    //v1 = twoSum1(nums, 8);
    printVector(nums, v1, 2);
    
    v2 = threeSum(nums, 9);
    printVector(nums, v2, 3);
    
    v3 = fourSum(nums, 14);
    printVector(nums, v3, 4);   
}

输出：

2nums result is: 
3 & 5
2 & 6
3nums result is: 
1 & 2 & 6
1 & 3 & 5
2 & 3 & 4
4nums result is: 
1 & 2 & 5 & 6
1 & 3 & 4 & 6
2 & 3 & 4 & 5