1.數組的相關注意事項
錯誤示范一
String strs[] = new String[2]{"a", "b"};
正確示范一
String strs[] = new String[]{"a", "b"};
?讓JVM自己判斷有幾個數據,無需再其中寫明有幾組數據
錯誤示范二
String strs[] = new String{"a", "b"};
正確示范二
String strs[] = {"a", "b"};
2.數組相關練習
/*
已知有個升序數組,要求插入一個元素,該數組順序依然是升序的
*/
import java.util.Scanner;
public class ArrayHomework01 {public static void main(String[] args) {Scanner myScanner = new Scanner(System.in);int arr[] = {10, 12, 45, 90};int arr2[] = new int[arr.length + 1];System.out.println("請輸入你要添加的數字");int addNum = myScanner.nextInt();for (int j = 0; j < arr.length; j++) {//直接擴容arr2[j] = arr[j];arr2[j+1] = addNum;}arr = arr2;//將原數組地址定位到擴容后的數組的地址int temp = 0;for (int i = 0; i < arr.length; i++) {//再用冒泡算法重新排列int times = arr.length - 1;for (int j = 0; j < times; j++) {if (arr[j] > arr[j+1]) {temp = arr[j];arr[j] = arr[j+1];arr[j+1] = temp;}}}for (int i = 0; i < arr.length; i++) {//輸出排列完后的數組System.out.print(arr[i] + " ");}}
}
//解法2
public class ArrayHomework01 {public static void main(String[] args) {int arr[] = {10, 12, 45, 90};int insertNum = 23;int index = -1;for (int i = 0; i < arr.length; i++) {if (insertNum <= arr[i]) {index = i;break;} } if (index == -1) {index = arr.length;}//System.out.print(index);int arrNew[] = new int[arr.length + 1];for (int i = 0, j = 0; i < arrNew.length; i++) {if (i != index) {arrNew[i] = arr[j];j++;} else {arrNew[i] = insertNum;}}arr = arrNew;for (int i = 0; i < arr.length; i++) {System.out.print(arr[i] + " ");}}
}