数组的声明与创建
package com.FreeGiao.array;
public class ArrayDemo01 {
public static void main(String[] args) {
// int[] nums = new int[10];
//nums[0] = 1;
int[] nums;//1.声明一个数组
nums = new int[10];//2.创建一个数组
nums[0] = 1;
nums[1] = 2;
nums[2] = 3;
nums[3] = 4;
nums[4] = 5;
nums[5] = 6;
nums[6] = 7;
nums[7] = 8;
nums[8] = 9;
for (int i = 0; i < nums.length; i++) {
System.out.println("[" + i + "]" + "=" + nums[i]);
}
}
}
数组的三种初始化
package com.FreeGiao.array;
public class ArrayDemo02 {
public static void main(String[] args) {
//静态初始化:创建+赋值
int[] num1 = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
System.out.println(num1[0]);
//动态初始化:包含默认初始化
int[] num2 = new int[10];
num2[0] = 1;
System.out.println(num2[0]);
/*
数组的默认初始化
数组是引用类型,元素相当于类的实例变量,因此数组一经分配空间,
其中的每个元素也被按照实例变量的同样的方法被隐式初始化。
*/
System.out.println(num2[1]);
System.out.println(num2[2]);
}
}
数组的使用
数组的反转
package com.FreeGiao.array;
import java.util.Arrays;
public class ArrayDemo03 {
public static void main(String[] args) {
// int[] array = {1,2,3,4,5,6,7,8,9,10};
// int Max = 0;
// for (int i = 0; i < array.length; i++) {
// if (array[i]>Max){
// Max = array[i];
// }
// }
// System.out.println("Max="+Max);
int[] array = {1, 5, 3, 4, 5, 6, 7, 8, 9, 10};
// Arrays.sort(array);
// for (int x : array) {
// System.out.println(x);
// }
//PrintArrys(array);
PrintArrys(ReverArrays(array));
}
public static int[] ReverArrays(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 PrintArrys(int[] arrays) {
for (int i = 0; i < arrays.length; i++) {
System.out.println(arrays[i]);
}
}
}
多维数组
package com.FreeGiao.array;
public class ArrayDemo04 {
public static void main(String[] args) {
int[][] nums = {{1,2},{3,4},{5,6},{7,8}};
System.out.println(nums.length);
System.out.println(nums[0]);
//PrintArrys(nums[3]);
System.out.println(nums[1][1]);
for (int i = 0; i < nums.length; i++) {
for (int j = 0; j <nums[i].length ; j++) {
System.out.println(nums[i][j]);
}
}
}
public static void PrintArrys(int[] arrays) {
for (int i = 0; i < arrays.length; i++) {
System.out.print(arrays[i]+" ");
}
}
}
冒泡排序
package com.FreeGiao.array;
import java.util.Arrays;
public class ArraysDemo05 {
public static void main(String[] args) {
int[] array = {5,8,9,6,3,2,4,7,78,9,5,2,156};
int[] gg = sort(array);
System.out.print(Arrays.toString(gg));
}
public static int[] sort(int[] arrays){
int temp = 0;
for (int i = 0; i <arrays.length-1 ; i++) {
for (int j = 0; j < arrays.length-1; j++) {
if (arrays[j+1]>arrays[j]) {
temp = arrays[j];
arrays[j] = arrays[j+1];
arrays[j+1] = temp;
}
}
}
return arrays;
}
}
稀疏数组
package com.FreeGiao.array;
public class ArrayDemo05 {
public static void main(String[] args) {
int[][] num = new int[11][11];
num[1][2] = 1;
num[2][3] = 2;
for (int[] gg : num) {
for (int kk : gg) {
System.out.print(kk + "\t");
}
System.out.println();
}
//转换为稀疏数组保存
//获取有效值的个数
int sum = 0;
for (int i = 0; i < 11; i++) {
for (int i1 = 0; i1 < 11; i1++) {
if (num[i][i1] != 0) {
sum += 1;
}
}
}
System.out.println("有效值的个数为:" + sum);
//创建一个稀疏数组
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 < num.length; i++) {
for (int j = 0; j < num[i].length; j++) {
if (num[i][j] != 0) {
count++;
array2[count][0] = i;
array2[count][1] = j;
array2[count][2] = num[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]);
}
//读取稀疏数组
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];
}
for (int[] gg : array3) {
for (int kk : gg) {
System.out.print(kk + "\t");
}
System.out.println();
}
}
}