package array;
public class Demo01 {
public static void main(String[] args) {
int[] nums; //声明一个数组
nums = new int[9];//创建一个数组
//给数组中元素赋值
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;
// 计算所有元素的和
int sum = 0;
// 获取数组长度:arrays.length
for (int i = 0; i < nums.length; i++) {
sum = sum + nums[i];
}
System.out.println("总和为"+sum);
}
}
package array;
public class Demo02 {
public static void main(String[] args) {
//静态初始化: 创建+赋值
int[] a = {1,2,3,4,5,6,7,7};
System.out.println(a[0]);
//动态初始化:包含默认初始化
int[] b = new int[10];
b[0] = 10;
b[1] = 20;
System.out.println(b[0]);
System.out.println(b[1]);
System.out.println(b[2]);
System.out.println(b[3]);
//结果显示没有赋值的元素默认为0
}
}
package array;
public class Demo03 {
public static void main(String[] args) {
int[] arrays = {1,2,3,4,5};
//打印全部数组
for (int i = 0; i < arrays.length; i++) {
System.out.println(arrays[i]);
}
System.out.println("==================");
//计算所有元素的和
int sum = 0;
for (int i = 0; i < arrays.length; i++) {
sum += arrays[i];
}
System.out.println("sum="+sum);
System.out.println("================");
//查找最大元素
int max = arrays[0];
for (int i = 0; i < arrays.length; i++) {
if (arrays[i]>max){
max = arrays[i];
}
}
System.out.println("max="+max);
}
}
package array;
public class Demo04 {
public static void main(String[] args) {
int[] arrays = {1,2,3,4,5};
//增强型for循环,没有下标
// for (int array : arrays) {
// System.out.println(array);
// }
// printArray(arrays);
int[] reverse = reverse(arrays);
printArray(reverse);
}
//打印数组元素
public static void printArray(int[] arrays) {
for (int i = 0; i < arrays.length; i++) {
System.out.println(arrays[i]+"");
}
}
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;
}
}
package array;
public class Demo05 {
public static void main(String[] args) {
int[][] array = {{1,2},{3,4},{4,5},{5,6}};
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array[i].length; j++) {
System.out.println(array[i][j]);
}
}
}
}
package array;
import java.util.Arrays;
public class Demo06 {
public static void main(String[] args) {
int[] a = {1,2,3,5,4,78,34,12,34,7};
int[] sort = sort(a);
System.out.println(Arrays.toString(sort));
}
public static int[] sort(int[] array) {
int temp = 0;
for (int i = 0; i < array.length-1; i++) {
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;
}
}
}
return array;
}
}