LeetCode 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 (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m andn respectively.

class Solution {public:    void merge(int A[], int m, int B[], int n) {     int i = 0, j = 0;    while(j < n && i < m+j) {    //i及其之后数全部后移一位     if(A[i] > B[j]) {    for(int k = m-1+j; k >= i; k--)    A[k+1] = A[k];    A[i] = B[j];        j++;    i++;    }    else    i++;    }     //B[]还有剩余数需添加在结尾     while(j < n)    A[i++] = B[j++];    }};