代码随想录DAY7：四数相加II + 赎金信 + 三数之和 + 四数之和

1. 四数相加II

【注意】比起“四数之和”，此题是四个不同数组，因此不用考虑重复问题两两哈希map就行。

class Solution {
public:
    int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
        unordered_map<int, int> map;
        for (auto a : nums1) {
            for (auto b : nums2) {
                map[a + b] ++;
            }
        }
        int count = 0;
        for (auto c : nums3) {
            for (auto d : nums4) {
                    if (map.find(0 - c - d) != map.end()) {
                        count += map[0 - c - d];
                    }
            }
        }
        return count;
    }
};

2. 赎金信

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        if (ransomNote.length() > magazine.length()) {
            return false;
        }
        unordered_map<char,int> map;
        for (auto item : magazine) {
            map[item]++;
        }
        for (auto item : ransomNote) {
            if (map.find(item) != map.end()) {
                map[item]--;
            }
            else {
                map[item] = -1;
            }
            if (map[item] < 0) {
                return false;
            }
        }
        return true;
    }
};

3. 三数之和

【注意】用哈希去重较麻烦，因此使用双指针法

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> result;
        sort(nums.begin(),nums.end());
        for(int i = 0;i<nums.size();i++){
            if(nums[i]>0) return result;
            if(i>0&&nums[i]==nums[i-1]) continue;
            int left = i+1;
            int right = nums.size()-1;
            while(left<right){
                if(nums[i]+nums[left]+nums[right]>0) right--;
                else if(nums[i]+nums[left]+nums[right]<0) left++;
                else{
                    result.push_back(vector<int>{nums[i],nums[left],nums[right]});
                    while(right>left&&nums[right]==nums[right-1]) right--;
                    while(right>left&&nums[left]==nums[left+1]) left++;
                    right--;
                    left++;
                } 
            }
        }
        return result;
    }
};

4. 四数之和

【注意】同理，使用双指针法

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<vector<int>> result;
        sort(nums.begin(),nums.end());
        for(int i = 0; i<nums.size(); i++){
            if(nums[i]>target&&nums[i]>=0) break;
            if (i>0&&nums[i]==nums[i-1]) continue;
            for(int j = i+1;j<nums.size();j++){
                if(nums[i]+nums[j]>target&&nums[i]+nums[j]>=0) break;
                if(j>i+1&&nums[j]==nums[j-1]) continue;
                int left = j+1;
                int right = nums.size()-1;
                while(left<right){
                    if((long)nums[i]+nums[j]+nums[left]+nums[right]>target) right--;
                    else if((long)nums[i]+nums[j]+nums[left]+nums[right]<target) left++;
                    else{
                        result.push_back(vector<int>{nums[i],nums[j],nums[left],nums[right]});
                        while(right>left&&nums[right]==nums[right-1]) right--;
                        while(right>left&&nums[left]==nums[left+1]) left++;
                        left++;
                        right--;
                    }
                }
            }
        }
        return result;
    }
};