Valid Anagram:验证不考虑字母顺序不同的单词是否相同

最新推荐文章于 2020-08-14 19:15:37 发布

想改名的小雄鹿

最新推荐文章于 2020-08-14 19:15:37 发布

阅读量436

点赞数

分类专栏： Leetcode 文章标签： Java Leecode string

本文链接：https://blog.csdn.net/u013300579/article/details/78111884

版权

Leetcode 专栏收录该内容

188 篇文章 1 订阅

订阅专栏

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?

类似于之前

group anagrams http://blog.csdn.net/u013300579/article/details/78055521，不再啰嗦

思路一：排序

public boolean isAnagram(String s, String t) {
    if (s.length() != t.length()) {
        return false;
    }
    char[] str1 = s.toCharArray();
    char[] str2 = t.toCharArray();
    Arrays.sort(str1);
    Arrays.sort(str2);
    return Arrays.equals(str1, str2);
}

思路二：编码

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