代码随想录-map

预备知识

coding

day6

-242. 有效的字母异位词

    void SetRecord(const std::string input, int* record){
        for(char c : input){
            ++record[c - '0'];
        }
    }

    bool Cmp(int* record1, int* record2, int len){
        for(int i = 0; i < len; ++i){
            if(record1[i] != record2[i]){
                return false;
            }
        }
        return true;
    }

    bool isAnagram(string s, string t) {
        int record1[100] = {0};
        int record2[100] = {0};

        SetRecord(s, record1);
        SetRecord(t, record2);

        return Cmp(record1, record2, 100);
    }

• 349. 两个数组的交集
  

    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        int count[1001] = {0};
        for(auto ele : nums1){
            ++count[ele];
        }
        std::vector<int> ret;
        for(auto ele : nums2){
            if(count[ele] > 0){
                ret.push_back(ele);
                count[ele] = 0;	// 保证不重复
            }
        }
        return ret;
    }

• 202. 快乐数
  
  快乐数的重点在于判断出不存在的情况下存在循环情况,sum值在求解过程中一定会重复。

    int Get(int number){
        const int array[] = {0, 1, 4, 9, 16, 25, 36, 49, 64, 81};
        int ret = 0;
        while(number){
            ret += array[number % 10];
            number /= 10;
        }
        return ret;
    }
    bool isHappy(int n) {
        
        std::unordered_set<int> count;
        while(true){
            int sum = Get(n);
            if(sum == 1){
                return true;
            }

            if(count.count(sum)){
                return false;
            }
            count.insert(sum);
            n = sum;
        }
        return false;
    }

• 1. 两数之和
  

    vector<int> twoSum(vector<int>& nums, int target) {
        std::unordered_map<int, int> record;

        for(int index = 0; index < nums.size(); ++index){
            auto itr = record.find(nums[index]);
            if(itr != record.end()){
                return {itr->second, index};
            }
            record[target - nums[index]] = index;
        }
        return {};
    }

day7

• 454. 四数相加 II
  

    std::vector<int> TwoVectorSum(vector<int>& nums1, vector<int>& nums2){
        std::vector<int> ret;
        for(const auto num1 : nums1){
            for(const auto num2 : nums2){
                ret.push_back(num1 + num2);
            }
        }
        return ret;
    }
    int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
        std::vector<int> sum1 = TwoVectorSum(nums1, nums2);
        std::vector<int> sum2 = TwoVectorSum(nums3, nums4);

        std::unordered_map<int, int> record;

        for(const auto num : sum1){
            if(record.count(num) == 0){
                record[num] = 0;
            }
            
            ++record[num];
        }

        int result = 0;
        for(const auto num : sum2){
            if(record.count(-num) == 0){
                continue;
            }
            result += record[-num];
        }
        return result;
    }

• 383. 赎金信
  

    bool canConstruct(string ransomNote, string magazine) {
        int count[128] = {0};
        for(char c : magazine){
            ++count[c - 'a'];
        }
        for(char c : ransomNote){
            if(count[c - 'a'] == 0){
                return false;
            }
            --count[c - 'a'];
        }
        return true;
    }