【26】242. Valid Anagram

242. Valid Anagram

• Total Accepted: 135534
• Total Submissions: 300699
• Difficulty: Easy
• Contributors: Admin

Given two strings s and t, write a function to determine if t is an anagram of s.

For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return false.

Note:
You may assume the string contains only lowercase alphabets.

Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?

Solution 1：用哈希表

class Solution {
public:
//哈希表映射
    bool isAnagram(string s, string t) {
        //用map
        if(s.size() != t.size()) return false;
        unordered_map<char, int> mp;
        for(int i = 0; i < s.size(); i++){
            mp[s[i]]++;
        }
        for(int i = 0; i < t.size(); i++){
            mp[t[i]]--;
            if(mp[t[i]] < 0) return false;
        }
        return true;
    }
};

 

Solution 2：用vector实现hash表

class Solution {
public:
//哈希表映射
    bool isAnagram(string s, string t) {
        //用vector
        if(s.size() != t.size()) return false;
        vector<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']--;
            if(hash[t[i] - 'a'] < 0) return false;
        }
        return true;
    }
};