LeetCode 321. 拼接最大数

class Solution {
public:
    vector maxNumber(vector& nums1, vector& nums2, int k) {
        int n= nums1.size(), m = nums2.size();

        vector res(k,INT_MIN);

        for(int i=max(0,k-m);i<=min(k,n);i++){
            auto a=maxarry(nums1,i);
            auto b=maxarry(nums2,k-i);
            auto c=merge(a,b);
            res=max(res,c);
        }
        return res;


    }
    vector merge(vector& a,vector& b){
        vector c;
        while(a.size()&&b.size())
            if(a>b) c.push_back(a[0]),a.erase(a.begin());
            else c.push_back(b[0]),b.erase(b.begin());
        
        while(a.size()) c.push_back(a[0]),a.erase(a.begin());
        while(b.size()) c.push_back(b[0]),b.erase(b.begin());

        return c;

         
    }
    vector maxarry(vector& nums,int k){
        vector res(k);
        int n=nums.size();
        for(int i=0,j=0;ik) j--;

            if(j