leetCode练习（242）

题目：Valid Anagram
难度：Easy
问题描述：

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.

解题思路：
    将s和t转为数组，排序后比较是否相等即可。本题的测试条件为s和t同长不为null。

    代码如下：

public class Solution {
public boolean isAnagram(String s, String t) {
char[]stoc = s.toCharArray();
char[]ttoc = t.toCharArray();
Arrays.sort(ttoc);
Arrays.sort(stoc);
return Arrays.equals(ttoc, stoc)==true?true:false;
}
}