第三章 哈希表part01（代码随想录）

242.有效的字母异位词 

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

    }
};

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 (int num:nums2){
            if(nums_set.find(num)!=nums_set.end()){
                result_set.insert(num);
            }
        }
        return vector<int>(result_set.begin(), result_set.end());
    }
};

202. 快乐数

class Solution {
public:
    bool isHappy(int n) {
        unordered_set<int> set;
        while (1){
            int sum = getSum(n);
            if (sum == 1){
                return true;
            }
            if (set.find(sum) != set.end()) {
                return false;
            } else {
                set.insert(sum);
            }
            n = sum;
        }
    }
    int getSum(int n){
        int sum=0;
        while(n){
            sum+=(n%10)*(n%10);
            n/=10;
        }
        return sum;
    }
};

1. 两数之和   

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        map<int, int> map;
        for (int i = 0; i < nums.size(); i++) {
            if (!(map.count(target - nums[i])>0)) {
                map[nums[i]]=i;
            }
            else {
                int val = map[target - nums[i]];
                return {val, i};
            }
        }
        return {-1, -1};
    }
};