懒虫的家

永久域名 http://lxy19791111.javaeye.com

Struts2.0与DWR2.0 的整和 | 《Design By Contract原则与实践》精彩片断 ...

2007-09-16

Java面试题

关键字: 面试

有两个数组,而且都已排序好,现要求将它们合并到一个新的数组c中,并且要求按顺序排列.本人的解答如下:

java 代码

public class SortTest {

/**
* @param args
*/
public static void main(String[] args) {
  char a[] = {'f','g','i','l','m','x','y'};
  char b[] = {'a','c','h','n'};

  char c[] = new char[a.length+b.length];

  int cnt = 0;
  int j = 0;
  int i = 0;
  do{
   if(b[i]<a[j]){
    c[cnt] = b[i];
    cnt ++;
    i ++;
    continue;
   }else{
    c[cnt] = a[j];
    cnt ++;
    j ++;
    continue;
   }
  }while((i<b.length) && (j<a.length));

  if(j==a.length){
   for(int x = (b.length -(c.length-cnt));x<b.length ;x++){
    c[cnt] = b[x];
    cnt ++;
   }
  }else if(i==b.length){
   for(int x = (a.length -(c.length-cnt));x<a.length ;x++){
    c[cnt] = a[x];
    cnt ++;
   }
  }
  System.out.println("a = "+String.valueOf(a));
  System.out.println("b = "+String.valueOf(b));
  System.out.println("c = "+String.valueOf(c));
}