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

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        // 两个vec，vecA,vecB，然后合并到A中
        vector<int>vec(m+n, 0);
        int count = 0;
        for (int i = 0; i < m; i++) {
            cout << A[i];
            vec[count++] = A[i];
        }
        for (int i = 0; i < n; i++) {
            vec[count++] = B[i];
        }
        sort(vec.begin(), vec.end());
        for (int i = 0; i < m + n; i++) {
            A[i] = vec[i];
        }
        
        
    }
};