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.

 

来源： <https://oj.leetcode.com/problems/merge-sorted-array/>

 

 

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int i=m-1 ,j=n-1,k=m+n-1;
        if(A==null||B==null|| n==0)  return ;
    
        while(i>=0&&j>=0)
        {    if(A[i]>B[j])
            {
                A[k]=A[i];
                --i;
            }
            else
            {
                A[k] = B[j];
                --j;
            }
            --k;
        }
        
        if(i<0)
           { while(j>=0)
              {  A[k]=B[j];
                --j;
                --k;
              }
           }
    }
}