[88]Merge Sorted Array

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note:
You may assume that A has enough space to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

class Solution {public:    void merge(int A[], int m, int B[], int n) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        int index = m + n - 1;        int aIndex = m - 1;        int bIndex = n - 1;                while(index >= 0 && aIndex >= 0 && bIndex >= 0)        {            if(A[aIndex] > B[bIndex])            {                A[index--] = A[aIndex--];            }            else            {                A[index--] = B[bIndex--];            }        }                while(aIndex >= 0) A[index--] = A[aIndex--];        while(bIndex >= 0) A[index--] = B[bIndex--];    }};