[LintCode] 合并排序数组II

 class Solution {
 public:
     /**
      * @param A: sorted integer array A which has m elements,
      *           but size of A is m+n
      * @param B: sorted integer array B which has n elements
      * @return: void
      */
     void mergeSortedArray(int A[], int m, int B[], int n) {
         // write your code here
         int pa = m - , pb = n - , p = m + n - ;
         while (pa >=  && pb >= ) {
             if (A[pa] >= B[pb]) A[p--] = A[pa--];
             else A[p--] = B[pb--];
         }
         while (pb >= ) A[p--] = B[pb--];
     }
 };