LeetCode 242. Valid Anagram

package com.gloomy.leetcode;

/**
* 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.
*
* @author 过路的守望
*
*/
public class ValidAnagram {
public boolean isAnagram(String s, String t) {
/*
* 字符串s,t都为空
*/
if(s==null&&t==null){
return true;
}
/*
* 字符串s、t只有一个为空
*/
if(s==null||t==null){
return false;
}
/*
* 字符串s、t的长度不同
*/
if(s.length()!=t.length()){
return false;
}
/*
* ASCII码2^8
*/
int[] letter = new int[256];
char[] charS = s.toCharArray();
char[] charT = t.toCharArray();
for(char c:charS){
letter[c]++;
}
for(char c:charT){
letter[c]–;
}
for(int k:letter){
if( k != 0){
return false;
}
}
return true;

}

}