LeetCode 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.
• 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 == null || t == null) {
            return false;
        }
        int sLen = s.length();
        int tLen = t.length();
        if (sLen == 0 && tLen == 0) {
            return true;
        }
        if (sLen != tLen) {
            return false;
        }
        int[] map = new int[26];
        for (int i = 0; i < sLen; i++) {
            ++map[s.charAt(i) - 'a'];
        }
        for (int i = 0; i < tLen; i++) {
            --map[t.charAt(i) - 'a'];
            if (map[t.charAt(i) - 'a'] < 0) {
                return false;
            }
        }
        return true;
    }
}