LeetCode 242. Valid Anagram

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

Example 1:

Input: s = "anagram", t = "nagaram"
Output: true

Example 2:

Input: s = "rat", t = "car"
Output: 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?

 

 

代码：

class Solution {
    private HashMap<Character,Integer> agMap=new HashMap();
    public boolean isAnagram(String s, String t) {
        if(s==null||t==null||s.length()!=t.length())
            return false;
      
        for(int i=0;i<s.length();i++){
            if(agMap.get(s.charAt(i))!=null&&agMap.get(s.charAt(i))>0){
                agMap.put(s.charAt(i),agMap.get(s.charAt(i))+1);
            }else{
                agMap.put(s.charAt(i),1);
            }
        }
        
        for(int i=0;i<t.length();i++){
            if(agMap.get(t.charAt(i))==null||agMap.get(t.charAt(i))<=0){
                return false;
            }else{
                agMap.put(t.charAt(i),agMap.get(t.charAt(i))-1);
            }
        }
        
        return true;
    }
}