Leetcode 哈希表（一）

242. 有效的字母异位词

力扣题目链接

class Solution {
public:
    bool isAnagram(string s, string t) {
        int record[26] = {0};
        for(int i = 0; i < s.size(); i++){
            record[s[i] - 'a']++;
        }
        for(int i = 0; i < t.size(); i++){
            record[t[i] - 'a']--;
        }
        for(int i = 0; i < 26; i++){
            if(record[i] != 0){
                return false;
            }
        }
        return true;
    }
};

1002. 查找共用字符

力扣题目链接

class Solution {
public:
    vector<string> commonChars(vector<string>& words) {
        int hash[26] = {0};
        for(int i = 0; i < words[0].size(); i++){
            hash[words[0][i] - 'a']++;
        }

        int hashOtherStr[26] = {0};
        for(int i = 1; i < words.size(); i++){
            memset(hashOtherStr, 0, 26 * sizeof(int));
            for(int j = 0; j <words[i].size(); j++){
                hashOtherStr[words[i][j] - 'a']++;
            }
            for(int k = 0; k < 26; k++){
                hash[k] = min(hash[k], hashOtherStr[k]);
            }
        }

        vector<string> result;
        for(int i = 0; i < 26; i++){
            while(hash[i] != 0){
                string s(1, i + 'a');
                result.push_back(s);
                hash[i]--;
            }
        }
    return result;
    }
};

349. 两个数组的交集

力扣题目链接

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        unordered_set<int> result_set;
        unordered_set<int> nums_set(nums1.begin(), nums1.end());
        for(auto num: nums2){
            if(nums_set.find(num) != nums_set.end()){  //nums.end()指向最后一个元素的下一个位置
                result_set.insert(num);
            }
        }
        return vector<int> (result_set.begin(),result_set.end());
    }
};

1. 两数之和

力扣题目链接

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> map;
        for(int i = 0; i < nums.size(); i++){
            auto iter = map.find(target - nums[i]);
            if(iter != map.end()){
                return {iter->second, i};
            }
            map.insert(pair<int, int>(nums[i], i));
        }    
        return {};
    }
};

383. 赎金信

力扣题目链接

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        int record[26] = {0};
        for(int i = 0; i < magazine.size(); i++){
            record[magazine[i] - 'a']++;
        }
        for(int j = 0; j <ransomNote.size(); j++){
            record[ransomNote[j] - 'a']--;
            if(record[ransomNote[j] - 'a'] < 0){
                return false;
            }
        }
        return true;
    }
};

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(auto num1 : nums1){
            for(auto num2 : nums2){
                map[num1 + num2]++;
            }
        }
        int count = 0;
        for(auto num3 : nums3){
            for(auto num4 :nums4){
                if(map.find(0 - num3 - num4) != map.end()){
                    count += map[0 - num3 - num4];
                }
            }
        }
        return count;
    }
};