Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 17.9 MB (19.04%)

Author: jimit105

0031-next-permutation/README.md

@@ -0,0 +1,47 @@
+<p>A <strong>permutation</strong> of an array of integers is an arrangement of its members into a sequence or linear order.</p>
+
+<ul>
+	<li>For example, for <code>arr = [1,2,3]</code>, the following are all the permutations of <code>arr</code>: <code>[1,2,3], [1,3,2], [2, 1, 3], [2, 3, 1], [3,1,2], [3,2,1]</code>.</li>
+</ul>
+
+<p>The <strong>next permutation</strong> of an array of integers is the next lexicographically greater permutation of its integer. More formally, if all the permutations of the array are sorted in one container according to their lexicographical order, then the <strong>next permutation</strong> of that array is the permutation that follows it in the sorted container. If such arrangement is not possible, the array must be rearranged as the lowest possible order (i.e., sorted in ascending order).</p>
+
+<ul>
+	<li>For example, the next permutation of <code>arr = [1,2,3]</code> is <code>[1,3,2]</code>.</li>
+	<li>Similarly, the next permutation of <code>arr = [2,3,1]</code> is <code>[3,1,2]</code>.</li>
+	<li>While the next permutation of <code>arr = [3,2,1]</code> is <code>[1,2,3]</code> because <code>[3,2,1]</code> does not have a lexicographical larger rearrangement.</li>
+</ul>
+
+<p>Given an array of integers <code>nums</code>, <em>find the next permutation of</em> <code>nums</code>.</p>
+
+<p>The replacement must be <strong><a href="http://en.wikipedia.org/wiki/In-place_algorithm" target="_blank">in place</a></strong> and use only constant extra memory.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3]
+<strong>Output:</strong> [1,3,2]
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [3,2,1]
+<strong>Output:</strong> [1,2,3]
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,5]
+<strong>Output:</strong> [1,5,1]
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 100</code></li>
+</ul>

0031-next-permutation/solution.py

@@ -0,0 +1,27 @@
+# Approach 2: Single Pass Approach
+
+# Time: O(n)
+# Space: O(1)
+
+class Solution:
+    def nextPermutation(self, nums: List[int]) -> None:
+        """
+        Do not return anything, modify nums in-place instead.
+        """
+        # Step 1: Find the first pair from right where nums[i] < nums[i+1]
+        i = len(nums) - 2
+        while i >= 0 and nums[i + 1] <= nums[i]:
+            i -= 1
+
+        if i >= 0:
+             # Step 2: Find the smallest number greater than nums[i] to its right
+            j = len(nums) - 1
+            while nums[j] <= nums[i]:
+                j -= 1
+
+            # Step 3: Swap nums[i] and nums[j]
+            nums[i], nums[j] = nums[j], nums[i]
+
+        # Step 4: Reverse the subarray after position i
+        nums[i + 1 :] = reversed(nums[i + 1 :])
+