算法二刷day6

242.有效的字母异位词

class Solution {
public:
    bool isAnagram(string s, string t) {
        int record[26] = {0};
        for (char c : s) {
            record[c - 'a']++;
        }
        for (char c : t) {
            record[c - 'a']--;
        }
        for (int i = 0; i < 26; i++) {
            if (record[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> nums1_set(nums1.begin(), nums1.end());
        for (int a : nums2) {
            if (nums1_set.find(a) != nums1_set.end()) result_set.insert(a);
        }
        return vector<int> (result_set.begin(), result_set.end());
    }
};

202. 快乐数

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

1. 两数之和

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