Leetcode 347 initial solution

Author: mavsun

Steve_Implementation/leetcode worked solutions.ipynb

@@ -107,6 +107,52 @@
     "\n",
     "        return list(hash.values())\n"
    ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 122,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "{0: [], 1: []}\n"
+     ]
+    },
+    {
+     "data": {
+      "text/plain": [
+       "[1]"
+      ]
+     },
+     "execution_count": 122,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "### LEETCODE 347\n",
+    "\n",
+    "### the optimal solution would have first count each element\n",
+    "### then flip the count and the key\n",
+    "### this solution does the other way around, which gets the elem from nums\n",
+    "### based on how many times it had appeared.\n",
+    "### very slow and expensive\n",
+    "\n",
+    "nums = [1] #4, -1\n",
+    "k = 2\n",
+    "\n",
+    "hash = {i:[] for i in range(len(nums)+1)}\n",
+    "print(hash)\n",
+    "for i in set(nums):\n",
+    "    hash[nums.count(i)] += [i]\n",
+    "\n",
+    "L = []\n",
+    "for i in list(hash.values()):\n",
+    "    L += i\n",
+    "L[-k:]"
+   ]
   }
  ],
  "metadata": {