242

74

Author: Victorherowin

Week_01/id_16/242

@@ -0,0 +1,11 @@
+class Solution {
+   public boolean isAnagram(String s,String t)
+   {
+       char[] sChars=s.toCharArray();
+       char[] tChars=t.toCharArray();
+       Arrays.sort(sChars);
+       Arrays.sort(tChars);
+       return String.valueOf(sChars).equals(String.valueOf(tChars));
+
+   }
+}

Week_01/id_16/74

@@ -0,0 +1,26 @@
+import java.util.*;
+class Solution {
+    public List<List<String>> groupAnagrams(String[] strs)
+    {
+        List<String> a=new List();
+        for(int i=0;i<strs.length;i++)
+        {
+            arrays.sort(a);
+
+        }
+    }
+}
+
+  if (strs.length==0)
+        return new ArrayList();
+        Map<String, List> ans = new HashMap<String, List>();
+        for (String s:strs)
+        {
+            char[] ca=s.toCharArray();
+            Arrays.sort(ca);
+            String key=String.valueOf(ca);
+            if (!ans.containsKey(key)) ans.put(key, new ArrayList());
+            ans.get(key).add(s);
+        }
+     return new ArrayList(ans.values());
+    }