@@ -0,0 +1,547 @@
+/**%0A * Given two strings s and t, write a function to determine if t is an anagram of s. %0A * For example, s = %22anagram%22, t = %22nagaram%22, return true. s = %22rat%22, t = %22car%22, return false.%0A * Note: You may assume the string contains only lowercase alphabets.%0A * @author Jun%0A *%0A */%0A%0Apublic class Solution %7B%0A    public boolean isAnagram(String s, String t) %7B%0A        char%5B%5D sArray = s.toCharArray();%0A        Arrays.sort(sArray);%0A        char%5B%5D tArray = t.toCharArray();%0A        Arrays.sort(tArray);%0A        return Arrays.equals(sArray, tArray);%0A    %7D%0A%7D%0A

Create 242.java