39_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 n respectively

1:特殊情况，B == NULL , n <= 0；2:分别从后道前遍历AB两个数组，并把相应的数字保存到数字A中；3:如果数组B中的数字存在剩余，则依次拷贝到数组A中

    void merge(int A[], int m, int B[], int n)    {        if(B == NULL || n <= 0)        {            return;        }                int i = m - 1;        int j = n - 1;        int index = m + n - 1;                for(; i >= 0 && j >= 0;)        {            if(A[i] >= B[j])            {                A[index--] = A[i--];            }            else            {                A[index--] = B[j--];            }        }                if( j >= 0)        {            while(j >= 0)            {                A[index--] = B[j--];            }        }        return;    }