final solution Leetcode 49

Author: mavsun

Steve_Implementation/leetcode worked solutions.ipynb

@@ -76,51 +76,36 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 1,
+   "execution_count": 49,
    "metadata": {},
    "outputs": [
     {
      "data": {
       "text/plain": [
-       "[['tea', 'ate', 'tan'], ['ate'], ['nat'], ['bat']]"
+       "[['tan', 'nat'], ['eat', 'tea', 'ate'], ['bat']]"
       ]
      },
-     "execution_count": 1,
+     "execution_count": 49,
      "metadata": {},
      "output_type": "execute_result"
     }
    ],
    "source": [
     "### Leetcode 49\n",
     "\n",
-    "strs = [\"eat\",\"tea\",\"tan\",\"ate\",\"nat\",\"bat\"]\n",
-    "\n",
-    "l = []\n",
-    "ll = []\n",
-    "a = 0\n",
-    "b = a + 1\n",
-    "while a != len(strs):\n",
-    "    if a == len(strs) - 1:\n",
-    "        ll.append([strs[a]])\n",
-    "        break\n",
-    "\n",
-    "    elif sorted(strs[a]) == sorted(strs[b]):\n",
-    "        l.append(strs[b])\n",
-    "        strs.remove(strs[a])\n",
-    "\n",
-    "    b += 1\n",
-    "\n",
-    "    if b == len(strs):\n",
-    "        l.append(strs[a])\n",
-    "        ll.append(l)\n",
-    "        l = []\n",
+    "class Solution(object):\n",
+    "    def groupAnagrams(self, strs):\n",
+    "        \"\"\"\n",
+    "        :type strs: List[str]\n",
+    "        :rtype: List[List[str]]\n",
+    "        \"\"\" \n",
     "\n",
-    "        a += 1\n",
-    "        b = a + 1\n",
+    "        hash = {j:[] for j in set([''.join(sorted(i)) for i in strs])}\n",
     "\n",
-    "ll\n",
+    "        for i in strs:\n",
+    "            hash[''.join(sorted(i))].append(i)\n",
     "\n",
-    "    "
+    "        return list(hash.values())\n"
    ]
   }
  ],