题解 | #合并两个有序的数组#

import java.util.*;
public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        for(int i=m+n-1;i>=n;i--){
            A[i] = A[i - n];
        }
        for(int i=n,j=0,k=0;i<=m+n-1||j<=n-1;){
            if(i > m + n - 1 && j <= n - 1){
                A[k++] = B[j++];
            }
            else if(i <= m + n - 1 && j > n - 1){
                A[k++] = A[i++];
            }
            else{
                if(A[i] > B[j]) A[k++] = B[j++];
                else A[k++] = A[i++];
            }
        }
    }
}