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

1. Program

Problem Link: https://leetcode.com/problems/valid-anagram/

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

1. https://discuss.leetcode.com/topic/24179/java-solution-using-sort
2. https://discuss.leetcode.com/topic/20314/accepted-java-o-n-solution-in-5-lines

来源：CSDN

作者：beijingbuaaer

链接：https://blog.csdn.net/beijingbuaaer/article/details/52263719