数组
概述
数组声明创建
//数组类型
public static void main(String[] args){
int[] nums;//1.定义
nums = new int[5];//2.创建一个数组
//3.给数组元素中赋值
nums[0] = 0;
nums[1] = 1;
nums[2] = 2;
nums[3] = 3;
nums[4] = 4;
//计算所有元素的和
int sum = 0;
//获取数组长度:arrays.length
for (int i = 0; i < nums.length; i++) {
sum+=nums[i];
}
System.out.println("总和为:"+sum);//10
}
内存分析
初始化
数组的四个基本特点
数组使用
for-each循环
public static void main(String[] args){
int[] arrays = {1,2,3,4,5};
//没有下标
for (int array : arrays) {
System.out.println(array);
}
}
数组作方法入参
反转数组
//数组类型
public static void main(String[] args){
int[] arrays = {1,2,3,4,5};
int[] reverse = reverse(arrays);
pringArray(reverse);//结果为5,4,3,2,1
}
//反转数组
public static int[] reverse(int[] arrays){
int[] result = new int[arrays.length];
//反转操作
for (int i = 0,j=arrays.length-1; i < arrays.length; i++,j--) {
result[j] = arrays[i];
}
return result;
}
//打印数组元素
public static void pringArray(int[] arrays){
for (int i = 0; i < arrays.length; i++) {
System.out.println(arrays[i]);
}
}
多维数组
public static void main(String[] args){
//多维数组
int[][] array = {{1,2},{2,3},{3,4},{4,5}};
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array[i].length; j++) {
System.out.println(array[i][j]);
}
}
}
Arrays类
public static void main(String[] args){
int[] a = {12,453,45,65,98,3,5};
// System.out.println(a);//结果:[I@1b6d3586
// System.out.println(Arrays.toString(a));//结果:[12, 453, 45, 65, 98, 3, 5]
Arrays.sort(a);//数组进行排序:升序
System.out.println(Arrays.toString(a));//结果:[3, 5, 12, 45, 65, 98, 453]
}
冒泡排序
//冒泡排序
public static int[] sort(int[] array){
int temp = 0;//临时变量
//外层循环,判断我们这个要走多少次
for (int i = 0; i < array.length-1; i++) {
boolean flag = false;//优化,通过flag标识位减少没有意义的比较
//内层循环,比较判断两个数,如果第一个数比第二个数大,则交换
for (int j = 0; j < array.length-1-i; j++) {
if (array[j+1]>array[j]){
temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
flag = true;
}
}
if (flag == false){
break;
}
}
return array;
}
稀疏数组
public static void main(String[] args){
//1. 创建一个二维数组11*11 0:没有棋子 1:黑棋 2:白棋
int[][] array1 = new int[11][11];
array1[1][2] = 1;
array1[2][3] = 2;
//输出原始数组
System.out.println("输出原始数组");
for (int[] ints : array1) {
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();
}
//获取有效值的个数
int sum = 0;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
if (array1[i][j]!=0){
sum++;
}
}
}
System.out.println("========================");
System.out.println("不为零的个数:"+sum);//不为零的个数
System.out.println("========================");
//转换为稀疏数组保存
//创建一个稀疏数组的数组
int[][] array2 = new int[sum+1][3];
array2[0][0] = 11;
array2[0][1] = 11;
array2[0][2] = sum;
//遍历二维数组,将非零的值存放稀疏数组中
int count = 0;
for (int i = 0; i < array1.length; i++) {
for (int j = 0; j < array1[i].length; j++) {
if (array1[i][j]!=0){
count++;
array2[count][0] = i;
array2[count][1] = j;
array2[count][2] = array1[i][j];
}
}
}
//输出稀疏数组
System.out.println("输出稀疏数组");
for (int i = 0; i < array2.length; i++) {
System.out.println(array2[i][0]+"\t"+
array2[i][1]+"\t"+
array2[i][2]);
}
System.out.println("===============");
//还原
System.out.println("还原");
int[][] array3 = new int[array2[0][0]][array2[0][1]];
for (int i = 1; i < array2.length; i++) {
array3[array2[i][0]][array2[i][1]] = array2[i][2];
}
//打印
System.out.println("输出还原的数组");
for (int[] ints : array3) {
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();
}
}
结果,如下图