https://oj.leetcode.com/problems/merge-sorted-array/

Q88.cpp

class Solution {
  public:
    void merge(int A[], int m, int B[], int n) {
      int C[m+n];
      int a = 0, b = 0, c = 0;
      while (a < m && b < n) {
        while (a < m && A[a] <= B[b]) {
          C[c++] = A[a++];
        }
        while (b < n && B[b] <= A[a]) {
          C[c++] = B[b++];
        }
      }
      if (a == m) {
        while (b < n) C[c++] = B[b++];
      } else if (b == n) {
        while (a < m) C[c++] = A[a++];
      }
      for (int cc = 0; cc < m + n; cc++) {
        A[cc] = C[cc];
      }
    }
};