Leetcode-321. Create Maximum Number

最新推荐文章于 2022-08-09 10:30:26 发布

caoyan_12727

最新推荐文章于 2022-08-09 10:30:26 发布

阅读量595

点赞数

分类专栏： leetcode算法文章标签： leetcode-321. Create

本文链接：https://blog.csdn.net/caoyan_12727/article/details/53040034

版权

leetcode算法专栏收录该内容

25 篇文章 0 订阅

订阅专栏

广州已经入秋了，天气慢慢变冷，虽然冷得不是那么明显，所以还是经常刷刷题暖暖身吧！！废话不说，直接上题：

题目：

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]

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

源码：

class Solution {
public:
	vector<vector<int>>get_max_number(vector<int>&nums){
		int size = nums.size();
		vector<vector<int>>n1(size + 1);
		vector<int>::iterator  j,k;
		//获取nums1每位最大的数
		bool flag = true;
		for (int i = size; i >= 1; i--){
			flag = true;
			if (i == size)n1[i] = nums;
			else{
				n1[i] = n1[i + 1];
				for (j = ++n1[i].begin(); j != n1[i].end(); j++){
					if (*j > *(j - 1)){
						j=n1[i].erase(j - 1);//清除前一位
						flag = false;
						break;
					}
				}
				if (flag){
					n1[i].pop_back();
				}
			}
		}
		return n1;
	}

	vector<int>merge(int n1, vector<int>&r1, int n2, vector<int>&r2){
		vector<int>re;
		int count1 = 0;
		int count2 = 0;
		while (count1 < n1&&count2 < n2){
			if (r1[count1] < r2[count2])re.push_back(r2[count2++]);
			else if (r1[count1] > r2[count2]) re.push_back(r1[count1++]);
			else{//如果两个数相等
				int s1 = count1, s2 = count2;
				while (s1 < n1&&s2 < n2&&r1[s1] == r2[s2]){//开始比较
					s1++;
					s2++;
				}
				if (s1 == n1 || (s2<n2&&r2[s2]>r1[s1]))re.push_back(r2[count2++]);
				else re.push_back(r1[count1++]);
			}
		}
		if (count1 == n1){//r1先结束
			for (int i = count2; i < n2; i++)re.push_back(r2[i]);
		}
		if (count2 == n2){//r1先结束
			for (int i = count1; i < n1; i++)re.push_back(r1[i]);
		}
		return re;
	}

	vector<int> maxNumber(vector<int>& nums1, vector<int>& nums2, int k) {
		int size1 = nums1.size();
		int size2 = nums2.size();
		vector<vector<int>>r1, r2;
		r1 = get_max_number(nums1);
		r2 = get_max_number(nums2);
		vector<int>re;
		vector<int>total;
		if (size1 + size2 < k)return total;
		for (int i = 0; i <= k; i++){//取num1中的第i个数
			if (!(i <= size1&&k - i <= size2))continue;
			if (i == 0)re = r2[k - i];
			else re = merge(i, r1[i], k - i, r2[k - i]);
			if (total.size() == 0)total = re;
			else{
				for (int i = 0; i < k; i++){
					if (total[i] == re[i])continue;
					else if (total[i]>re[i])break;
					else total = re;
				}
			}
		}
		return total;
	}
};

运行结果：