Created using Colaboratory

SouvikDcoder · SouvikDcoder · commit e3ef1c994e03 · 2022-10-08T17:42:23.000+05:30
diff --git a/leetcode_kuro_RnD.ipynb b/leetcode_kuro_RnD.ipynb
@@ -7808,11 +7808,11 @@
         "  "
       ],
       "metadata": {
-        "id": "x9UttcXT7klc",
-        "outputId": "391d3633-0681-4b53-9260-8c0d2c439831",
         "colab": {
           "base_uri": "https://localhost:8080/"
-        }
+        },
+        "id": "x9UttcXT7klc",
+        "outputId": "391d3633-0681-4b53-9260-8c0d2c439831"
       },
       "execution_count": 50,
       "outputs": [
@@ -7824,6 +7824,52 @@
           ]
         }
       ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "class Solution(object):\n",
+        "    def convert(self, s, numRows):\n",
+        "        if numRows == 1 or numRows >= len(s):\n",
+        "            return s\n",
+        "        # This is a vague sentence for python beginers\n",
+        "        L = [''] * numRows\n",
+        "        # it can be replaced by the following:\n",
+        "        # L = []\n",
+        "        # for i in range(0, numRows):\n",
+        "        #     L.append('')\n",
+        "        # so if numRows = 3, L = ['', '', '']\n",
+        "        index, step = 0, 1\n",
+        "\n",
+        "        for x in s:\n",
+        "            L[index] += x\n",
+        "            # start #\n",
+        "            if index == 0:\n",
+        "                step = 1\n",
+        "            elif index == numRows -1:\n",
+        "                step = -1\n",
+        "            #1 end  #\n",
+        "            # I like to explain the part above\n",
+        "            # take the str \"PAYPALISHIRING\" for example:\n",
+        "            # We start with variable index with the value 0, step with the value 1\n",
+        "            # Each row added with the next char\n",
+        "            # If we reach the bottommost row, we need to turn to the next above row, so we change the step value to -1\n",
+        "            # we keep the step value until we reach topmost row. DON'T CHANGE IT!\n",
+        "            # Again, if we reach the topmost row, we need to reset the step value to 1\n",
+        "            # What we need to remember is:\n",
+        "            # the zigzag pattern is just a pictorial image for us to have a better understanding\n",
+        "            # What the trick of algorithm is actually add the next char of the given string to different rows.\n",
+        "            # Don't really think how to move the cursor in the matrix.\n",
+        "            # It's really misleading way you think of this. Even it works, it's not efficient.\n",
+        "            index += step\n",
+        "\n",
+        "        return ''.join(L)"
+      ],
+      "metadata": {
+        "id": "SNWpSw99fBLU"
+      },
+      "execution_count": null,
+      "outputs": []
     }
   ],
   "metadata": {
