题解 | #合并两个有序的数组#

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        vector<int>p;
        int l=0,r=0;
        while(l<m&&r<n)
        {
            if(A[l]>B[r])p.push_back(B[r++]);
            else p.push_back(A[l++]);
        }
        while(l<m)p.push_back(A[l++]);
        while(r<n)p.push_back(B[r++]);
        for(int i=0;i<m+n;i++)
        A[i]=p[i];
    }
};