1.一维数组;
2.二维数组(重点)
3.遍历数组
1.双FOR循环
for (int j = 0; j < ar[0].length ; j++) {
for (int i =3 ; i >=0; i–) {
System.out.print(ar[i][j]);
}
System.out.println();
};
2.双FOREACH循环
for (char[] cs : ar) {
System.out.println(cs);
}
或者
for (char[] cs : ar) {
for (char cs2 : cs) {
System.out.print(cs2);
}
System.out.println();
};
4.数组填充和批量替换
5.对数组进行排序(只支持升序)
6.复制数组
7.直接选择排序
精髓:第一个开始,选择出最大的值,最大的往每轮的最后一位挪;
int [] a =new int []{2,1,3,4,5,8,9,6,7};
int index;
for (int i =1; i < a.length; i++) {
index =0;
for (int j = 1; j <= a.length-i; j++) {
if (a[j]>a[index]) {
index =j;
}
int temp = a[a.length-i];
a[a.length-i]=a[index];
a[index]= temp;
}}
for ( int tem : a) {
System.out.print(tem+" "); }
8.冒泡排序
精髓:前后比较,大的往后挪再去比较后一位。;
int [] a =new int []{2,1,3,4,5,8,9,6,7};
for (int i =1; i < a.length; i++) {
for (int j = 0; j < a.length-i; j++) {
if (a[j]>a[j+1]) {
int temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}
}
}
for ( int tem : a) {
System.out.print(tem+" ");
}