leetcode 242. Valid Anagram

Seawolf

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 {
    public boolean isAnagram(String s, String t) {
        
        if(s.length() == 0 && t.length() == 0) return true;
        
        if(s.length() == 0 || t.length() == 0) return false;
        
        if(s.length() != t.length()) return false;
        
        char[] s1 = s.toCharArray();
        char[] t1 = t.toCharArray();
        
        int[] res = new int[256];
        
        for(int i = 0; i< s1.length; i++){
            
            res[s1[i]]++;
        }
        
        for(int i = 0; i< t1.length; i++){
            
            if(res[t1[i]]-- == 0) return false;
        }
        return true;
    }
}