解法一: import java.util.*; public class Solution { public void merge(int A[], int m, int B[], int n) { int i = 0,j = 0,k = 0;//定义指针 int [] C = new int [m + n]; while(i < m && j < n){ if(A[i]<B[j]){ C[k++]=A[i++]; }el...