[LeetCode]--242. Valid Anagram(Count table && char array sort())

1. Program

2. Solution

2.1. Count Table Solution

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

Sort Array Solution

public class Solution {
public boolean isAnagram(String s, String t) {
char[] sChar = s.toCharArray();
char[] tChar = t.toCharArray();
Arrays.sort(sChar);
Arrays.sort(tChar);
return Arrays.equals(sChar, tChar);
}
}

3. Reference