mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
39 lines
1.2 KiB
HTML
39 lines
1.2 KiB
HTML
<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 <= 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> </p>
|
|
<p><strong>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>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>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums1 = [3,9], nums2 = [8,9], k = 3
|
|
<strong>Output:</strong> [9,8,9]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>m == nums1.length</code></li>
|
|
<li><code>n == nums2.length</code></li>
|
|
<li><code>1 <= m, n <= 500</code></li>
|
|
<li><code>0 <= nums1[i], nums2[i] <= 9</code></li>
|
|
<li><code>1 <= k <= m + n</code></li>
|
|
</ul>
|