Leetcode 题目解析之 Valid Anagram

原创

ruochen

发布于 2022-01-14 11:29:23

1.4K0

发布于 2022-01-14 11:29:23

文章被收录于专栏：若尘的技术专栏

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?

用数组模拟哈希表，统计字符出现次数。

    public boolean isAnagram(String s, String t) {
        if (s == null || t == null) {
            return false;
        }
        if (s.length() != t.length()) {
            return false;
        }
        if (s.equals(t)) {
            return false;
        }
        int len = s.length();
        int[] map = new int[26];
        // 统计s中每个字符出现的次数
        for (int i = 0; i < len; i++) {
            map[s.charAt(i) - 'a']++;
        }
        // 减去t中相应字符出现次数
        for (int i = 0; i < len; i++) {
            map[t.charAt(i) - 'a']--;
            if (map[t.charAt(i) - 'a'] < 0) {
                return false;
            }
        }
        for (int i = 0; i < 26; i++) {
            if (map[i] != 0) {
                return false;
            }
        }
        return true;
    }

原创声明：本文系作者授权腾讯云开发者社区发表，未经许可，不得转载。

如有侵权，请联系 cloudcommunity@tencent.com 删除。

case