Class Solution
- java.lang.Object
-
- g0301_0400.s0321_create_maximum_number.Solution
-
public class Solution extends Object
321 - Create Maximum Number.Hard
You are given two integer arrays
nums1andnums2of lengthsmandnrespectively.nums1andnums2represent the digits of two numbers. You are also given an integerk.Create the maximum number of length
k <= m + nfrom digits of the two numbers. The relative order of the digits from the same array must be preserved.Return an array of the
kdigits representing the answer.Example 1:
Input: nums1 = [3,4,6,5], nums2 = [9,1,2,5,8,3], k = 5
Output: [9,8,6,5,3]
Example 2:
Input: nums1 = [6,7], nums2 = [6,0,4], k = 5
Output: [6,7,6,0,4]
Example 3:
Input: nums1 = [3,9], nums2 = [8,9], k = 3
Output: [9,8,9]
Constraints:
m == nums1.lengthn == nums2.length1 <= m, n <= 5000 <= nums1[i], nums2[i] <= 91 <= k <= m + n
-
-
Constructor Summary
Constructors Constructor Description Solution()
-