代码随想录算法训练营Day6 |454.四数相加II，383. 赎金信，15. 三数之和，18. 四数之和

454.四数相加II

class Solution {
public:
    int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3,vector<int>& nums4) {
        unordered_map<int, int> map;
        for (int a : nums1) {
            for (int b : nums2) {
                map[a + b]++;
            }
        }
        int count = 0;
        // 查询0-(c+d)即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. 赎金信

length——数组的属性；
length()——String的方法；
size()——集合的方法；

在C++中，针对std::string对象，size()和length()实际上是等效的，它们都返回字符串中字符的数量（即字符串的长度。

以下方法只适用于题中给出的测试示例

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        if (magazine.length() < ransomNote.length()) {
            return false;
        } 
        else {
            int count = 0;
            for (int i = 0; i < ransomNote.length(); i++) {
                if (ransomNote[i] == magazine[i]) {
                    count++;
                }
            }
            if (count == ransomNote.length()) {
                return true;
            } 
            else {
                return false;
            }
        }
    }
};

哈希法 数组

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        if (ransomNote.length() > magazine.length()) {
            return false;
        }
        int arr[26] = {0};
        for (int i = 0; i < magazine.length(); i++) {
            arr[magazine[i] - 'a']++;
        }
        for (int j = 0; j < ransomNote.length(); j++) {
            arr[ransomNote[j] - 'a']--;//若有字母只在ransomNote中有，arr[ransomNote[j]-'a']<0
            if (arr[ransomNote[j] - 'a'] < 0) {
                return false;
            }
        }
        return true;
    }
};

15. 三数之和

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> res;
        sort(nums.begin(), nums.end());

        for (int i = 0; i < nums.size(); i++) {
            if (nums[i] > 0) {
                return res;
            }
            if (i > 0 && nums[i] == nums[i - 1]) {
                continue;
            }
            int left = i + 1;
            int right = nums.size() - 1;
            while (right > left) {
                if (nums[i] + nums[left] + nums[right] > 0)
                    right--;
                else if (nums[i] + nums[left] + nums[right] < 0)
                    left++;
                else {
                    res.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++;
                    }

                    left++;
                    right--;
                }
            }
        }
        return res;
    }
};

push_back() 在Vector最后添加一个元素

18. 四数之和

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

                        left++;
                        right--;
                    }
                }
            }
        }
        return res;
    }
};