代码随想录第六天

454 四数相加

class Solution {
public:
    int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
        int res = 0;
        unordered_map<int, int>  map1;  //第一个存储相加的值，第二个值存储数目
        unordered_map<int ,int > map2;
        for(auto a : nums1){
            for(auto b : nums2){
                int k = a + b;
                map1[k]++;
            }
        }

        int cnt = 0;
        for(auto c : nums3){
            for(auto d : nums4){
                if(map1.find(0-c-d) != map1.end()){
                    cnt += map1[0-c-d];
                } 
            }
        }
        return cnt;
    }
};

383 赎金信
想到的是用map容器；用数组可以节省空间

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        unordered_map<char , int> map1;
        for(char a : magazine){
            map1[a]++;
        }

        for(char b : ransomNote){
            if(map1.count(b)){
                map1[b]--;
                if(map1[b] < 0){
                    return false;
                }
            }
            else{
                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;
            }
            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 {
                    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;
        
    }
};

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;
            }
            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 ((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 (right > left && nums[left] == nums[left + 1]) {
                            left++;
                        }
                
                        right--;
                        left++;
                    }
                }
            }

        }
        return result;
    }
};