[LeetCode Sync] Runtime - 99 ms (94.66%), Memory - 18 MB (60.36%)

Author: NinePiece2

Solutions/0321-create-maximum-number/README.md

@@ -0,0 +1,39 @@
+<p>You are given two integer arrays <code>nums1</code> and <code>nums2</code> of lengths <code>m</code> and <code>n</code> respectively. <code>nums1</code> and <code>nums2</code> represent the digits of two numbers. You are also given an integer <code>k</code>.</p>
+
+<p>Create the maximum number of length <code>k &lt;= m + n</code> from digits of the two numbers. The relative order of the digits from the same array must be preserved.</p>
+
+<p>Return an array of the <code>k</code> digits representing the answer.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums1 = [3,4,6,5], nums2 = [9,1,2,5,8,3], k = 5
+<strong>Output:</strong> [9,8,6,5,3]
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums1 = [6,7], nums2 = [6,0,4], k = 5
+<strong>Output:</strong> [6,7,6,0,4]
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums1 = [3,9], nums2 = [8,9], k = 3
+<strong>Output:</strong> [9,8,9]
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>m == nums1.length</code></li>
+	<li><code>n == nums2.length</code></li>
+	<li><code>1 &lt;= m, n &lt;= 500</code></li>
+	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 9</code></li>
+	<li><code>1 &lt;= k &lt;= m + n</code></li>
+	<li><code>nums1</code> and <code>nums2</code> do not have leading zeros.</li>
+</ul>

Solutions/0321-create-maximum-number/solution.py

@@ -0,0 +1,82 @@
+class Solution:
+    def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:
+        # def pick_largest(nums: List[int], k: int) -> List[int]:
+        #     n = len(nums)
+        #     stack = [0] * k
+        #     top = -1
+        #     remain = n - k
+        #     for num in nums:
+        #         while top >= 0 and stack[top] < num and remain > 0:
+        #             top -= 1
+        #             remain -= 1
+        #         if top + 1 < k:
+        #             top += 1
+        #             stack[top] = num
+        #         else:
+        #             remain -= 1
+        #     return stack
+        
+        # def compare(nums1: List[int], nums2: List[int], i: int, j: int) -> bool:
+        #     if i >= len(nums1):
+        #         return False
+        #     elif j >= len(nums2):
+        #         return True
+        #     elif nums1[i] > nums2[j]:
+        #         return True
+        #     elif nums1[i] < nums2[j]:
+        #         return False
+        #     else:
+        #         return compare(nums1, nums2, i + 1, j + 1)
+        
+        # def merge(nums1: List[int], nums2: List[int]) -> List[int]:
+        #     m, n = len(nums1), len(nums2)
+        #     i = j = 0
+        #     result = [0] * (m + n)
+        #     for k in range(m + n):
+        #         if compare(nums1, nums2, i, j):
+        #             result[k] = nums1[i]
+        #             i += 1
+        #         else:
+        #             result[k] = nums2[j]
+        #             j += 1
+        #     return result
+
+        # m, n = len(nums1), len(nums2)
+        # left, right = max(0, k - n), min(k, m)
+        # result = [0] * k
+        # for val in range(left, right + 1):
+        #     temp = pick_largest(nums1, val)
+        #     temp2 = pick_largest(nums2, k - val)
+        #     temp3 = merge(temp, temp2)
+        #     if result < temp3:
+        #         result = temp3
+
+        # return result
+
+        def pick_largest(nums: List[int], val: int) -> List[int]:
+            stack = []
+            drop = len(nums) - val
+            for num in nums:
+                while drop and stack and stack[-1] < num:
+                    stack.pop()
+                    drop -= 1
+                stack.append(num)
+            return stack[:val]
+        
+        def merge(nums1: List[int], nums2: List[int]) -> List[int]:
+            result = []
+            while nums1 or nums2:
+                if nums1 > nums2:
+                    result.append(nums1.pop(0))
+                else:
+                    result.append(nums2.pop(0))
+            return result
+        
+        m, n = len(nums1), len(nums2)
+        result = []
+        for val in range(max(0, k - n), min(k, m) + 1):
+            part1 = pick_largest(nums1, val)
+            part2 = pick_largest(nums2, k - val)
+            check = merge(part1, part2)
+            result = max(result, check)
+        return result