2012-12-24 20:30:19
阅读( 0 )
试题1
指出下面语句没有编译错误的是( )。
A. long n = 999999999999;
B.int n = 999999999999L;
C. long n = 999999999999L;
D. double n = 999999999999;
试题2
完成代码计算10的阶乘并输出,应该填入的代码是( )
long result = 1;
for(int i = 2; i <= 10; i++) {
}
System.out.println(“result= ” + result);
… … …
A. result = result * i;
B. result = i*i;
C. result = i*(i+1);
D. reslut = i*(i-1);
试题3
下列关于数组的声明错误的是
A.int[] arry = new int[100];
B. int[3] arry = {1,2,3}
C. int[] arry = new int[]{1,2,3}
D. int[][] arry = new int[3][]
试题4
实现对数组arry的冒泡排序,应填入的代码是
public static void bubbleSort(int[] arry) {
int len = arry.length;
for (int i = 1; i < len; i++) {
boolean asc = true;
if (asc) return;
}
}
private static void swap(int[] arry, int i, int j) {
int temp = arry[i];
arry[i] = arry[j];
arry[j] = temp;
}
A.
for (int j = len-1; j > i; j–) {
if (arry[j] < arry[j - 1]) {
swap(arry, j, j – 1);
asc = false;
}
}
B.
for (int j = len – 1; j >= i; j–) {
if (arry[j] < arry[j - 1]) {
swap(arry, j, j – 1);
asc = false;
}
}
C.
for (int j = len – 1; j >= i; j–) {
if (arry[j] > arry[j - 1]) {
swap(arry, j, j – 1);
asc = false;
}
}
D.