Runtime: 5629 ms (Top 6.28%) | Memory: 14.3 MB (Top 62.78%)

Author: AnasImloul

scripts/algorithms/C/Create Maximum Number/Create Maximum Number.py

@@ -1,3 +1,4 @@
+# Runtime: 5629 ms (Top 6.28%) | Memory: 14.3 MB (Top 62.78%)
 class Solution:
     def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:
         def maximum_num_each_list(nums: List[int], k_i: int) -> List[int]:
@@ -12,23 +13,23 @@ def maximum_num_each_list(nums: List[int], k_i: int) -> List[int]:
             s = s[:len(s)-m] # very important
             return s
         def greater(a, b, i , j): # get the number which is lexiographically greater
-            while i< len(a) or j < len(b): 
+            while i< len(a) or j < len(b):
                 if i == len(a): return False
                 if j == len(b): return True
                 if a[i] > b[j]: return True
                 if a[i] < b[j]: return False
                 i += 1 # we increment until each of their elements are same
                 j += 1
-        
+
         def merge(x_num, y_num):
             n = len(x_num)
             m = len(y_num)
             i = 0
             j = 0
             s = []
             while i < n or j < m:
-                a = x_num[i] if i < n else float("-inf") 
-                b = y_num[j] if j < m else float("-inf") 
+                a = x_num[i] if i < n else float("-inf")
+                b = y_num[j] if j < m else float("-inf")
 
                 if a > b or greater(x_num, y_num, i , j):
 # greater(x_num, y_num, i , j): this function is meant for check which list has element lexicographically greater means it will iterate through both arrays incrementing both at the same time until one of them is greater than other.
@@ -46,10 +47,9 @@ def merge(x_num, y_num):
             second = maximum_num_each_list(nums2, k-i)
             merged = merge(first, second)
             # these two conditions are required because list comparison in python only compares the elements even if one of their lengths is greater, so I had to add these conditions to compare elements only if length is equal.
-			# Alternatively you can avoid this and convert them both to int and then compare, but I wanted to this as  it is somewhat more efficient.
-            if len(merged) == len(max_num_arr) and  merged > max_num_arr:
+            # Alternatively you can avoid this and convert them both to int and then compare, but I wanted to this as it is somewhat more efficient.
+            if len(merged) == len(max_num_arr) and merged > max_num_arr:
                 max_num_arr = merged
             elif len(merged) > len(max_num_arr):
                 max_num_arr = merged
         return max_num_arr
-