Merge Sorted Array 合并排序的数组

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=m+n-1;
    int a=m-1,b=n-1;
    while(a>=0&&b>=0)
    {
        if(A[a]>B[b])
        {
            A[i]=A[a];
            a--;
            i--;
        }
        else{
            A[i]=B[b];
            b--;
            i--;
        }
    }
    while(a>=0)
    {
        A[i]=A[a];
        a--;
        i--;
    }
    while(b>=0)
    {
        A[i]=B[b];
        b--;
        i--;
    }
    }
};