（五）判断两个词是否为变位词的算法

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.

==========================我是可爱的分隔符，上面是题目，下面是代码============================================

一、判断两个字符串都不为空

二、将字符串变为字符数组并将数组排序

三、遍历两个数组，如果对应字符串有不同，则返回false

public class Solution {public boolean isAnagram(String s, String t) {if (s.length() != t.length()) {return false;}if (s == null && t == null) {return true;} else if (s == null || t == null) {return false;}char a[] = s.toCharArray();char b[] = t.toCharArray();Arrays.sort(a);Arrays.sort(b);for (int i = 0; i < a.length; i++) {if (a[i] != b[i]) {return false;}}return true;}}