/* 知識點:數組 */ class ArrayDemo { public static void main(String[] args) { /* //數組大小 int size = 3; //定義數組 double[] myList = new double[size]; //初始化數組 myList[0] = 1.2; myList[1] = 3.0; myList[2] = 9.23; //計算全部元素的和 double total = 0; for (int i=0; i<size; i++) { total += myList[i]; System.out.println(myList[i]); } System.out.println("和 = " + total); */ //數組的靜態初始化(不用指定數組大小,有系統指定數組大小) /* String[] name = new String[]{"tantianran", "laowang"}; int[] age = new int[]{25, 30}; for (int i=0; i<name.length; i++) { System.out.println("name:"+name[i]+"age:"+age[i]); } */ /* //數組的動態初始化(由人爲設置元素個數) int[] nums = new int[3]; for (int i=0; i<nums.length; i++) { System.out.println(nums[i]); } */ /* //數組的基本操做 int[] numsl = new int[]{12,3,5,7,9}; System.out.println("數組長度=" + numsl.length); System.out.println("數組的第1個元素="+numsl[0]); System.out.println("數組的第2個元素="+numsl[1]); //修改索引爲1的元素 numsl[1] = 200; System.out.println("數組的第2個元素(修改後)="+numsl[1]); //遍歷數組元素 System.out.println("----------遍歷數組元素-----------"); for (int i=0; i<numsl.length; i++) { System.out.println(numsl[i]); } */ /* //獲取數組中最大的元素 int[] data_array = new int[]{4,7,20,9,4,2}; int max_num = ArrayDemo.getMax(data_array); System.out.println("最大值是=" + max_num); //按格式打印數組元素 String[] arr = {"A", "B", "C", "D", "E"}; ArrayDemo.printArray(arr); */ /* //逆序排序數組中的元素 String[] acc = new String[]{"A","B","C"}; ArrayDemo.printArray(acc); String[] new_acc = ArrayDemo.reverse(acc); ArrayDemo.printArray(new_acc); */ //元素出現索引(線性搜索) int[] arr = {10,20,30,10,50,-30,10}; } static int getIndex() { } //定義一個獲取元素最大值的方法 static int getMax(int[] array) { int max = array[0]; for (int i=0; i<array.length; i++) { if (array[i] > max) { max = array[i]; } } return max; } static void printArray(String[] arr) { String ret = "["; for (int i=0; i<arr.length; i++) { ret = ret + arr[i]; if (i != arr.length -1) { ret = ret + ", "; } } ret = ret + "]"; System.out.println(ret); } static String[] reverse(String[] oldArr) { //建立一個新的數組,存儲逆序後的元素 String[] new_arr = new String[oldArr.length]; for (int i=oldArr.length-1; i>=0; i--) { new_arr[oldArr.length-1-i] = oldArr[i]; } return new_arr; } }