数组声明创建:
dataType[] arrayRefVar;
java语言使用new操作符来创建数组, 语法如下:
dataType[] arrayRefVar = new dataType[arraySize];
获取数组的长度: arrays.length.
创建+赋值:int[] array = {1, 3, 2,4 ,5,6 };
Arrays:
Arrays.sort(数组名称); 排序
Arrays.toString(数组名称); 输出
Arrays.fill(数组名称); 填充数组
八大排序算法:
冒泡排序
//冒泡排序
public class Demo02 {
public static void main(String[] args) {
int[] test = {1, 23, 342, 545, 545, 545, 52, 532, 525, 432};
System.out.println(Arrays.toString(test));
for (int i = 0; i < test.length-1; i++) {
for (int j = 0; j < test.length-i-1; j++){
if (test[j]<test[j+1]){
int temp = test[j];
test[j] = test[j+1];
test[j+1] = temp;
}
}
}
System.out.println(Arrays.toString(test));
}
}
稀疏数组 :
// 稀疏数组
public class Demo03 {
/*
在一张11*11的棋盘上, 1代表白棋, 2代表黑棋
*/
public static void main(String[] args) {
int[][] a = new int[11][11];
a[1][2] = 1;
a[2][3] = 2;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++){
System.out.print(a[i][j] + "\t");
}
System.out.println();
}
System.out.println("=========================== 稀疏数组");
int value = 0;
for (int[] ints : a) {
for (int anInt : ints) {
if (anInt!=0){
value++;
}
}
}
int[][] b = new int[value+1][3];
b[0][0] = 11; //行
b[0][1] = 11; //列
b[0][2] = value; //数值
int k = 1;
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length; j++){
if (a[i][j] != 0){
b[k][0] = i;
b[k][1] = j;
b[k++][2] = a[i][j];
}
}
}
for (int[] ints : b) {
for (int anInt : ints) {
System.out.print(anInt + "\t");
}
System.out.println();
}
System.out.println("=========================== 还原稀疏数组");
int[][] c = new int[b[0][0]][b[0][1]];
for (int i = 1; i <b.length; i++) {
c[b[i][0]][b[i][1]] = b[i][2];
}
for (int[] ints : c) {
for (int anInt : ints) {
System.out.print(anInt + "\t");
}
System.out.println();
}
}
}