[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 and n respectively.

解题思路：
merge sort, 从后往前

Java Code

 public void merge(int A[], int m, int B[], int n) {
        int t = 1;
        int i = m-1;
        int j = n-1;
        
        while(i >= 0 && j>=0){
            if(A[i] > B[j]){
                A[m+n-t] = A[i];
                i--;
            }else{
                A[m+n-t] = B[j];
                j--;
            }
            
            t++;
        }
        
        while(j>=0){
            A[m+n-t] = B[j];
            t++;
            j--;
        }
    }