原题网址:https://leetcode.com/problems/create-maximum-number/
Given two arrays of length m
and n
with digits 0-9
representing two numbers. Create the maximum number of length k <= m + n
from digits of the two. The relative order of the digits from the same array must be preserved. Return an array of the k
digits. You should try to optimize your time and space complexity.
Example 1:
nums1 = [3, 4, 6, 5]
nums2 = [9, 1, 2, 5, 8, 3]
k = 5
return [9, 8, 6, 5, 3]
Example 2:
nums1 = [6, 7]
nums2 = [6, 0, 4]
k = 5
return [6, 7, 6, 0, 4]
Example 3:
nums1 = [3, 9]
nums2 = [8, 9]
k = 3
return [9, 8, 9]
方法:对于长度为k的数字,可以拆分为从nums1中选取i个,从nums2中选取k-i个,枚举i从0~k,然后合并得到一个候选数。注意比较的时候如果两个数字相等,则需要继续比较后面的数字。这道题的关键点有两个:第一是能否想到将问题拆分为等价的子问题,如果不拆分子问题作为一个整体来处理,则需要回溯,第二是注意比较的时候如何处理相等的数字。
public class Solution {
private int[] max(int[] nums, int k) {
int[] max = new int[k];
for(int i=0, j=0; i<nums.length; i++) {
while (j>0 && k-j<nums.length-i && max[j-1]<nums[i]) j--;
if (j<k) max[j++] = nums[i];
}
return max;
}
private int[] merge(int[] nums1, int[] nums2) {
int[] merged = new int[nums1.length+nums2.length];
for(int i=0, j=0, m=0; m<merged.length; m++) {
merged[m] = greater(nums1, i, nums2, j) ? nums1[i++] : nums2[j++];
}
return merged;
}
private boolean greater(int[] nums1, int i, int[] nums2, int j) {
while (i<nums1.length && j<nums2.length && nums1[i]==nums2[j]) {
i++;
j++;
}
return j==nums2.length || (i<nums1.length && nums1[i]>nums2[j]);
}
public int[] maxNumber(int[] nums1, int[] nums2, int k) {
int[] max = null;
for(int i=Math.max(k-nums2.length, 0); i<=Math.min(nums1.length, k); i++) {
int[] merged = merge(max(nums1, i), max(nums2, k-i));
if (max == null || greater(merged, 0, max, 0)) max = merged;
}
return max;
}
}
另一种实现:
public class Solution {
private int[] max(int[] nums, int k) {
int[] max = new int[k];
int from = 0;
for(int i=0; i<k; i++) {
for(int j=from+1; j+(k-i)<=nums.length; j++) {
if (nums[j] > nums[from]) from = j;
}
max[i] = nums[from];
from ++;
}
return max;
}
private int[] merge(int[] nums1, int[] nums2) {
int[] merged = new int[nums1.length+nums2.length];
for(int i=0, j=0, k=0; k<merged.length; k++) {
merged[k] = greater(nums1, i, nums2, j) ? nums1[i++] : nums2[j++];
}
return merged;
}
private boolean greater(int[] nums1, int f1, int[] nums2, int f2) {
while (f1 < nums1.length && f2 < nums2.length && nums1[f1] == nums2[f2]) {
f1 ++;
f2 ++;
}
return f2 == nums2.length || (f1 < nums1.length && nums1[f1] > nums2[f2]);
}
public int[] maxNumber(int[] nums1, int[] nums2, int k) {
int[] max = null;
for(int i=0; i<=k && i<=nums1.length; i++) {
int j=k-i;
if (j>nums2.length) continue;
int[] max1 = max(nums1, i);
int[] max2 = max(nums2, j);
int[] merged = merge(max1, max2);
if (max == null || greater(merged, 0, max, 0)) max = merged;
}
return max;
}
}