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.
2 解题思路
2.1题目属于排序题,另外需要注意一下String容器中不能直接排序。
3 源代码
package com.larry.easy;
import java.util.Arrays;
public class ValidAnagram {
public boolean isAnagram(String s, String t) {
char[] sArrays = s.toCharArray();
char[] tArrays = t.toCharArray();
Arrays.sort(sArrays);
Arrays.sort(tArrays);
return String.valueOf(sArrays).equals(String.valueOf(tArrays));
}
}