[LeetCode] 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?

解题思路

先排序，再比较是否相等。

实现代码

Java：

// Runtime: 8 mspublic class Solution {    public boolean isAnagram(String s, String t) {        char s1[] = s.toCharArray();        char t1[] = t.toCharArray();        Arrays.sort(s1);        Arrays.sort(t1);        return String.valueOf(s1).equals(String.valueOf(t1));    }}