Decompress Run-Length Encoded List

Author: nishantml

.ipynb_checkpoints/lets code-checkpoint.ipynb

@@ -1115,6 +1115,53 @@
     "print(sol.selfDividingNumbers(1,22))"
    ]
   },
+  {
+   "cell_type": "code",
+   "execution_count": 3,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "[2, 4, 4, 4]\n"
+     ]
+    }
+   ],
+   "source": [
+    "\"\"\"\n",
+    "1313. Decompress Run-Length Encoded List\n",
+    "\n",
+    "We are given a list nums of integers representing a list compressed with run-length encoding.\n",
+    "\n",
+    "Consider each adjacent pair of elements [freq, val] = [nums[2*i], nums[2*i+1]] (with i >= 0).  For each such pair, there are freq elements with value val concatenated in a sublist. Concatenate all the sublists from left to right to generate the decompressed list.\n",
+    "\n",
+    "Return the decompressed list.\n",
+    "\n",
+    "Input: nums = [1,2,3,4]\n",
+    "Output: [2,4,4,4]\n",
+    "\n",
+    "Explanation: The first pair [1,2] means we have freq = 1 and val = 2 so we generate the array [2].\n",
+    "The second pair [3,4] means we have freq = 3 and val = 4 so we generate [4,4,4].\n",
+    "At the end the concatenation [2] + [4,4,4] is [2,4,4,4].\n",
+    "\"\"\"\n",
+    "from typing import List\n",
+    "class Solution:\n",
+    "    def decompressRLElist(self, nums: List[int]) -> List[int]:\n",
+    "        outList = []\n",
+    "        for i in range(0,len(nums),2):\n",
+    "#             print(nums[i],nums[i+1])\n",
+    "            freq = nums[i] \n",
+    "            val = nums[i+1]\n",
+    "            for i in range(freq):\n",
+    "                outList.append(val)\n",
+    "        return outList\n",
+    "            \n",
+    "            \n",
+    "sol = Solution();\n",
+    "print(sol.decompressRLElist([1,2,3,4]))"
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": null,

lets code.ipynb

@@ -1115,6 +1115,53 @@
     "print(sol.selfDividingNumbers(1,22))"
    ]
   },
+  {
+   "cell_type": "code",
+   "execution_count": 3,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "[2, 4, 4, 4]\n"
+     ]
+    }
+   ],
+   "source": [
+    "\"\"\"\n",
+    "1313. Decompress Run-Length Encoded List\n",
+    "\n",
+    "We are given a list nums of integers representing a list compressed with run-length encoding.\n",
+    "\n",
+    "Consider each adjacent pair of elements [freq, val] = [nums[2*i], nums[2*i+1]] (with i >= 0).  For each such pair, there are freq elements with value val concatenated in a sublist. Concatenate all the sublists from left to right to generate the decompressed list.\n",
+    "\n",
+    "Return the decompressed list.\n",
+    "\n",
+    "Input: nums = [1,2,3,4]\n",
+    "Output: [2,4,4,4]\n",
+    "\n",
+    "Explanation: The first pair [1,2] means we have freq = 1 and val = 2 so we generate the array [2].\n",
+    "The second pair [3,4] means we have freq = 3 and val = 4 so we generate [4,4,4].\n",
+    "At the end the concatenation [2] + [4,4,4] is [2,4,4,4].\n",
+    "\"\"\"\n",
+    "from typing import List\n",
+    "class Solution:\n",
+    "    def decompressRLElist(self, nums: List[int]) -> List[int]:\n",
+    "        outList = []\n",
+    "        for i in range(0,len(nums),2):\n",
+    "#             print(nums[i],nums[i+1])\n",
+    "            freq = nums[i] \n",
+    "            val = nums[i+1]\n",
+    "            for i in range(freq):\n",
+    "                outList.append(val)\n",
+    "        return outList\n",
+    "            \n",
+    "            \n",
+    "sol = Solution();\n",
+    "print(sol.decompressRLElist([1,2,3,4]))"
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": null,