算法的考察:数组的复制、反转、查找(线性查找、二分法查找)
代码:
public class arraytest4 {
public static void main(String[] args) {
String[] arr = new String[] { "JJ", "DD", "MM", "BB", "GG", "AA" };
// 1.数组的复制(区别与数组变量的赋值,arr1 = arr)
System.out.println("数组的复制");
// 1.1复制
String[] arr1 = new String[arr.length];
for (int i = 0; i < arr1.length; i++) {
arr1[i] = arr[i];
}
// 1.2打印arr
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + "\t");
}
System.out.println();
// 1.3打印arr1
for (int i = 0; i < arr1.length; i++) {
System.out.print(arr1[i] + "\t");
}
System.out.println();
//
// 2.数组的反转
System.out.println("数组的反转");
// 2.1反转
// 方法一:
// for (int i = 0; i < arr.length / 2; i++) {
// String temp = arr[i];
// arr[i] = arr[arr.length - i - 1];
// arr[arr.length - i - 1] = temp;
// }
// 方法二:
for (int i = 0, j = arr.length - 1; i < j; i++, j--) {
String temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
// 2.2遍历
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + "\t");
}
}
}
输出:
数组的复制
JJ DD MM BB GG AA
JJ DD MM BB GG AA
数组的反转
AA GG BB MM DD JJ