算法二刷day7

最新推荐文章于 2024-06-15 23:36:03 发布

gsy-will

最新推荐文章于 2024-06-15 23:36:03 发布

阅读量124

点赞数 1

文章标签：算法数据结构

本文链接：https://blog.csdn.net/2301_76692276/article/details/136721264

版权

454.四数相加II

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

383. 赎金信

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        int record[26] = {0};
        if (ransomNote.size() > magazine.size()) return false;
        for (char a : magazine) {
            record[a - 'a']++;
        }
        for (char a : ransomNote) {
            record[a - 'a']--;
            if (record[a - '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; //这里比用while好，多一步剪枝操作
            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 {
                    res.push_back(vector<int> {nums[i], nums[left], nums[right]});
                    while (left < right && nums[right] == nums[right - 1]) right--;
                    while (right > left && nums[left] == nums[left + 1]) left++;
                    left++;
                    right--;
                }
            }
        }
        return res;
    }
};

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) break;
            if (k > 0 && nums[k] == nums[k - 1]) continue; // 第一重去重k
            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; // 第二重去重i
                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]});
                        while (right > left && nums[right] == nums[right - 1]) right--;
                        while (left < right && nums[left] == nums[left + 1]) left++;
                        left++;
                        right--;
                    }
                }
            }
        }
        return result;
    }
};