242. Valid Anagram



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.

public class Solution { public boolean isAnagram(String s, String t) { if(s==null||t==null||s.length()!=t.length()) return false; if(s.length()==0&&t.length()==0) return true; int[] a=new int[26]; for(int i=0;i<s.length();i++) { a[s.charAt(i)-'a']++; a[t.charAt(i)-'a']--; } for(int i=0;i<26;i++) { if(a[i]!=0) return false; } return true; } }