leetcode practice

day6:

242 Valid Anagram:

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

        for(int i = 0; i < 26; i++){
            if(map[i] != 0){
                return false;
            }
        }
        return true;

    }
};

 

349  Intersection of Two Arrays:

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        unordered_set<int> result;
        unordered_set<int> nums(nums1.begin(), nums1.end());
        for(int num:nums2){
            if(nums.find(num) != nums.end()){
                result.insert(num);
            }
        }
        vector<int> opt(result.begin(), result.end());
        return opt;
    }
};

 202 Happy number:

class Solution {
public:
    int getsum(int n){
        int sum = 0;
        while(n){
            sum += (n%10)*(n%10);
            n = n/10;
        }
        return sum;
    }

    bool isHappy(int n) {
        unordered_set<int> uset;
        while(true){
            int sum = getsum(n);
            if(sum == 1){
                return true;
            }

            if(uset.find(sum) != uset.end()){
                return false;
            }
            else{
                uset.insert(sum);
            }
            n = sum;
        }
        return false;
    }
};

1 Two sum:

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