第三章 哈希表part02 (代码随想录）

454.四数相加II 

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

383. 赎金信 

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        int hash[26] = {0};
        for (int i = 0; i < magazine.size(); i++) {
            hash[magazine[i]-'a']++;
        }
        for (int i = 0; i < ransomNote.size(); i++) {
            // 遍历ransomNote，在hash里对应的字符个数做--操作
            hash[ransomNote[i]-'a']--;
            if (hash[ransomNote[i]-'a'] < 0){
                return false;
            }
        }
        return true;
    }
};

15. 三数之和 

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;
            }
            // 去重a
            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]});
                // 对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;
    }
};

18. 四数之和 

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<vector<int>> result;
        sort(nums.begin(), nums.end());
        for (int k = 0; k < nums.size(); k++){
            // 剪枝处理
            if (nums[k] > target && nums[k] > 0 && target > 0){
                break;
            }
            // 对nums[k]去重
            if (k>0 && nums[k] == nums[k-1]){
                continue;
            }

            for (int i = k+1; i < nums.size(); i++){
                // 2级剪枝处理
                if (nums[k]+nums[i]>target && nums[k]+nums[i] > 0 && target > 0){
                    break;
                }
                // 对nums[i]去重
                if (i>k+1 && nums[i] == nums[i-1]){
                    continue;
                }
                int left = i + 1;
                int right = nums.size() - 1;
                while(left<right){
                    if ((long) nums[k]+nums[i]+nums[left]+nums[right] > target){
                        right--;
                    }

                    else if ((long) nums[k]+nums[i]+nums[left]+nums[right] < target) {
                        left++;
                    } else {
                        result.push_back(vector<int> {nums[k], nums[i], nums[left], nums[right]});
                        // 对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;
    }
};