1

2

3

4

String [] arr;

int?arr1[];

String[] array=new?String[5];

int?score[]=new?int[3];

1

2

3

4

5

6

7

8

9

10

//靜態初始化

int?arr2[]=new?int[]{1,2,3,4,5};

String[] array1={"馬超","馬云","關羽","劉備","張飛"};

String[] array2=new?String[]{"黃渤","張藝興","孫紅雷","小豬","牙哥","黃磊"};

int?score[]=new?int[3];

//動態初始化

for(int?i=0;i<score.length;i++)

{???

　　score[i]=i+1;?

}

1

2

int?length=array1.length;

System.out.println("length：? "+array1.length);

1

2

3

for?(int?i =?0; i < array1.length; i++) {

????System.out.println(array1[i]);

}

1

2

3

int[]? array3={1,2,3,4,5,6,7,8,9,0};

????????String arrStrings=Arrays.toString(array3);

????????System.out.println(arrStrings);

1

2

ArrayList<String> arrayList=new?ArrayList<String>(Arrays.asList(array1));

System.out.println(arrayList);

1

2

3

4

5

String a="馬超";

String[] array1={"馬超","馬云","關羽","劉備","張飛"};

if?(Arrays.asList(array1).contains(a)) {

????System.out.println("馬超在這里");

}

1

2

3

String[] array2=new?String[]{"黃渤","張藝興","孫紅雷","小豬","牙哥","黃磊"};

????Set<String> set=new?HashSet<String>(Arrays.asList(array2));

????System.out.println(set);

1

2

3

4

5

6

7

8

9

10

11

String[] array2=new?String[]{"黃渤","張藝興","孫紅雷","小豬","牙哥","黃磊"};

//方法 1.

List<String> list=new?ArrayList<String>();

for?(int?i =?0; i < array2.length; i++) {

????list.add(array2[i]);

}

?

String[] arrStrings2={"1","2","3"};

//方法 2.

List<String > list2=java.util.Arrays.asList(arrStrings2);

System.out.println(list2);

1

2

3

4

5

6

int[] arr3=new?int[5];

????????Arrays.fill(arr3,?10);??//將數組全部填充10

???????????????//遍歷輸出

????????for?(int?i =?0; i < arr3.length; i++) {

????????????System.out.println(arr3[i]);

????????}

1

2

3

4

5

6

7

8

9

10

11

12

//方法 1.

int[] arr4 = {3,?7,?2,?1,?9};

Arrays.sort(arr4);?????????//.sort(int[] a)?? 放入數組名字

for?(int?i =?0; i < arr4.length; i++) {

????System.out.println(arr4[i]);

}

//方法 2.????????

int[] arr5 = {3,?7,?2,?1,?9,3,45,7,8,8,3,2,65,34,5};

Arrays.sort(arr5,?1,?4);??//.sort(a, fromIndex, toIndex)??? 從第幾個到第幾個之間的進行排序

for?(int?i =?0; i < arr5.length; i++) {

????????System.out.println(arr5[i]);

}

1

2

3

4

5

6

7

8

//方法 1.

int[] arr6 = {3,?7,?2,?1};

int[] arr7=Arrays.copyOf(arr6,?10);??//指定新數組的長度

//方法 2.????????

int[] arr8=Arrays.copyOfRange(arr6,?1,?3);?//只復制從索引[1]到索引[3]之間的元素（不包括索引[3]的元素）

for?(int?i =?0; i < arr8.length; i++) {

????????System.out.println(arr8[i]);

}

1

2

3

int[] arr9 = {1,?2,?3,?4,5,6,7,8,9,0};

????????boolean?arr10=Arrays.equals(arr6, arr9);

????????System.out.println(arr10);

1

2

3

4

5

6

7

8

9

10

11

12

13

int[] arr11 = {1,?2,?3,?4,5,6,7,8,9,0,3,2,4,5,6,7,4,32,2,1,1,4,6,3};

//利用set的特性

Set<Integer> set2=new?HashSet<Integer>();

for?(int?i =?0; i < arr11.length; i++) {

????set2.add(arr11[i]);

}

System.out.println(set2);

int[] arr12 =?new?int[set2.size()];

int?j=0;

for?(Integer i:set2) {

????arr12[j++]=i;

}

System.out.println(Arrays.toString(arr12));

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

int[] arr11 = {10,?2,?3,?4,5,6,7,8,9,0,3,2,4,5,6,7,4,32,2,1,1,4,6,3};

?//計算最大值

int?max = arr11[0];

for?(int?i =?1; i < arr11.length; i++) {

?????if?(arr11[i] > max) {

?????????max = arr11[i];

????}

??}

??System.out.println("Max is "?+ max);

??//計算最小值

??int?min = arr11[0];

??for?(int?i =?0; i < arr11.length; i++) {

????if?(arr11[i]<min) {

????????min = arr11[i];

????}

}

??System.out.println("Min is "?+ min);