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

import java.util.*;
public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        //方法1：直接
        int copy[] = new int[m];
        for(int i = 0;i < m; i ++){
            copy[i] = A[i];
        }
        int i = 0;
        int j = 0;
        int k = 0;
        while(i < m && j < n){
            if(copy[i] <= B[j]){
                A[k ++] = copy[i ++];
            } else {
                A[k ++] = B[j ++];
            }
        }
        while(i < m){
            A[k ++] = copy[i++];
        }
        while(j < n){
            A[k ++] = B[j ++];
        }
    }
}