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

class Solution {
private:
    void BinaryInsert(int A[], int m, int newVal) {
        int left = 0;
        int right = m - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (A[mid] >= newVal) {
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        for (int i = m - 1; i >= left; i--) {
            A[i+1] = A[i];
        }
        A[left] = newVal;
    }
public:
    void merge(int A[], int m, int B[], int n) {
        for (int i = 0; i < n; i++) {
            BinaryInsert(A, m + i, B[i]);
        }
    }
};