java怎么实现对两个排好序的数组进行合并，并有序输出

Question

本帖最后由 doudou_880202 于 2011-01-16 12:15:34 编辑

Answer 1

public static int[] sort(int[] number1,int[] number2)
{
  int[] number3=new int[number1.length+number2.length];
  int i=0,j=0,k=0;
  while(i<number1.length && j<number2.length){
    if(number1[i]<=number2[j])
       number3[k++]=number1[i++];
    else
       number3[k++]=number2[j++];
  }
  while(i<number1.length)
    number3[k++] = number1[i++]; 
  while(i<number2.length)
    number3[k++] = number2[j++];  return  number3;
}

Answer 2

 while(i<number2.length)
这边打错了 是 j<number2.length
应该看得出来吧？

Answer 3

while(i<number2.length)
    number3[k++] = number2[j++];这个i应该改成j吧！