class Solution { public: void merge(int A[], int m, int B[], int n) { int C[m + n]; int pa = 0, pb = 0, pc = 0; if (m == 0 || n == 0) { if (n == 0) return; if (m == 0) { for (int i = 0; i < n; i++) { A[i] = B[i]; } return; } } else { A[m] = 100; B[n] = 100; while (pc != m + n) { if (A[pa] < B[...