package ox;
import java.util.Arrays;
import java.util.Date;
public class Demo04 {
public static void main(String[] args) {
//show1();//九九乘法表
//show2();//菱形方阵
//show3();//利用数组实现冒泡排序效果
//show4();//一维数组,二维数组的声明遍历及使用
show5();//Arrays工具类的使用方法
}
private static void show5() {
int[] s = new int[]{9,6,8,5,7,4,3,2,1};
Arrays.sort(s);//排序 升序
System.out.println(Arrays.toString(s));
Arrays.sort(s,2,3);//排序 作者还没搞懂
System.out.println(Arrays.toString(s));
Arrays.fill(s,5);//将数组全部赋值为value
System.out.println(Arrays.toString(s));
}
private static void show4() {
int[] a1 = new int[]{1,2,3,4,5,6,7};//声明
for (int i = 0; i < a1.length; i++) {
System.out.println(a1[i]);//遍历2
}
System.out.println("*".repeat(20));
int[][] a2 = new int[][]{{1,2},{55,5},{521,520},{8888,6666}};//二维数组的声明
for (int[] ints : a2) {
System.out.println(Arrays.toString(ints));
}
}
private static void show3() {
int[] a = new int[]{22,66,33,44,11,88,96,47,52,13,46,79};
//遍历
for (int i = 0; i < a.length-1; i++) {//外层循环是遍历次数
for (int j = 0; j < a.length-1-i; j++) {//内层循环是数组内部进行比较
if (a[j] i; j--) {
System.out.print("*");
}
System.out.println();
}
}
private static void show1() {
for (int i = 1; i < 10; i++) {
for (int j = 1; j < i+1; j++) {
System.out.print(i+"*"+j+"="+i*j);
System.out.print(" ");
}
System.out.println(" ");
}
}
}