代码随想录算法训练营第七天|Leetcode454.四数相加II Leetcode383.赎金信 Leetcode15.三数之和 Leetcode18.四数之和

Leetcode454.四数相加II

题目链接

注意回顾之前对于哈希表的一些基本操作的整理

class Solution {
public:
    int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
        int result = 0;
        unordered_map<int, int> hashmap;
        for (int i = 0; i < nums1.size(); ++i) {
            for (int j = 0; j < nums2.size(); ++j) {
                if (hashmap.count(nums1[i] + nums2[j]) <= 0) {
                    hashmap.insert(make_pair(nums1[i] + nums2[j], 1));
                }
                else {
                    hashmap[nums1[i] + nums2[j]] += 1;
                }
            }
        }
        for (int i = 0; i < nums3.size(); ++i) {
            for (int j = 0; j < nums4.size(); ++j) {
                if (hashmap.count(- (nums3[i] + nums4[j])) > 0) {
                    result += hashmap[- (nums3[i] + nums4[j])];
                }
            }
        }
        return result;
    }
};

Leetcode383.赎金信

题目链接

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        unordered_map<char, int> hashmap;
        for (int i = 0; i < magazine.size(); ++i) {
            if (hashmap.count(magazine[i]) <= 0) {
                hashmap.insert(make_pair(magazine[i], 1));
            }
            else {
                hashmap[magazine[i]]++;
            }
        }
        for (int i = 0; i < ransomNote.size(); ++i) {
            if (hashmap.count(ransomNote[i]) <= 0) {
                return false;
            }
            else if (hashmap[ransomNote[i]] == 1) {
                hashmap.erase(ransomNote[i]);
            }
            else {
                hashmap[ransomNote[i]]--;
            }
        }
        return true;
    }
};

Leetcode15.三数之和

题目链接

注意函数应用

    sort(nums.begin(), nums.end());

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) break;
            if (i > 0 && nums[i] == nums[i - 1]) continue;
            unordered_set<int> hashset;
            for (int j = i + 1; j < nums.size(); ++j) {
                if (j > i + 2 && nums[j] == nums[j - 1] && nums[j - 1] == nums[j - 2]) continue;
                int tmp = -(nums[i] + nums[j]);
                if (hashset.find(tmp) != hashset.end()) {
                    result.push_back({nums[i], nums[j], tmp});
                    hashset.erase(-(nums[i] + nums[j]));
                }
                else {
                    hashset.insert(nums[j]);
                }
            }
        }
        return result;
    }
}; //为什么这样会超时？

思考去重逻辑

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

Leetcode18.四数之和

题目链接

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] >= 0 || target >= 0) && nums[i] > target) break;
            if (i > 0 && nums[i] == nums[i - 1]) continue;
            for (int j = nums.size() - 1; j > i + 2; --j) {
                if (j < nums.size() - 1 && nums[j] == nums[j + 1]) {
                    continue;
                }
                int left = i + 1;
                int right = j - 1;
                while (left < right) {
                    if ((long)nums[i] + nums[left] + nums[right] + nums[j] > target) {
                        right--;
                    }
                    else if ((long)nums[i] + nums[left] + nums[right] + nums[j] < target) {
                        left++;
                    }
                    else {
                        result.push_back(vector<int>{nums[i], nums[left], nums[right], nums[j]});
                        while (left < right && nums[left] == nums[left + 1]) {
                            left++;
                        }
                        while (left < right && nums[right] == nums[right - 1]) {
                            right--;
                        }
                        left++;
                        right--;
                    }
                }
            }
        }
        return result;
    }
};

反思注意：

(long)nums[i] + nums[left] + nums[right] + nums[j]

今日学习时长：3h