二维数组练习

1.【杨辉三角】：

public class yangHui {
    public static void main(String[] args){
        int [][]yangHui =new int[10][];
        for(int i=0;i< yangHui.length;i++){
            yangHui[i]=new int[i+1];
            for(int j=0;j<yangHui[i].length;j++){
                if(j==0||j==yangHui[i].length-1){
                    yangHui[i][j]=1;
                }
                else{
                    yangHui[i][j]=yangHui[i-1][j]+yangHui[i-1][j-1];
                }
            }
        }
        System.out.println("-------数组如下--------");
        for(int i =0;i< yangHui.length;i++){
            for(int j=0;j<yangHui[i].length;j++){
                System.out.print(yangHui[i][j]+" ");
            }
            System.out.println();
        }
    }
}

2.随机生成1~100的数字保存到数组中，并倒叙打印，以及求平均值，最大值和最小值下标，并查找里面是否有8.

public class Array002 {
    public static void main(String[] args){
        int arr[] = new int[10];
        for(int i =0;i<arr.length;i++){
            arr[i]=(int)(Math.random()*100)+1;
        }
        System.out.println("======数组为=====");
        System.out.println("\t");
        for(int i =0;i<arr.length;i++){
            System.out.print(arr[i]+" ");
        }
        System.out.println();
       // System.out.println("======数组倒序为=====");
       // System.out.println("\t");
       // for(int i = arr.length-1;i>=0;i--){
            System.out.print(arr[i]+" ");
        //}
        double sum = arr[0];
        int Max = arr[0];
        int MaxIdex =0;
        for(int i =1;i<arr.length;i++){
            if(arr[0]<arr[i]){
                Max =arr[i];
                MaxIdex =i;
                sum = sum +arr[i];
            }
        }
        System.out.println();
        System.out.println("最大的数为："+Max+"\n"+"下标为:"+MaxIdex);
        System.out.println("平均值为："+sum/arr.length);
    }
}

3.有一个升序的数组，要求插入一个数组，这个数组依然顺序升序：

{10，12，45，90}

import java.util.Scanner;
public class Array011 {
    public static void main(String[] args){
        int array[]={1000,125,45,90};
        int array2[] = new int[array.length+1];
        for(int i=0;i<array.length;i++){
            array2[i]=array[i];
        }
        Scanner myScanner = new Scanner(System.in);
        System.out.println("请输入要插入的数组：");
        int n =myScanner.nextInt();
        array2[array2.length-1]=n;
        array=array2;
        for(int i =0;i<array.length;i++){
            System.out.print(array[i]+" ");
        }
        System.out.println();
        int temp=0;
        for(int i =0;i<array2.length;i++) {
            for (int j = 0; j < array2.length - i - 1; j++) {
                if (array2[j] > array2[j + 1]) {
                    temp = array2[j];
                    array2[j] = array2[j + 1];
                    array2[j + 1] = temp;
                }
            }
        }
            System.out.println("排序后的数组为：");
            for( int j =0;j<array2.length;j++){
                System.out.print(array2[j]+" ");
            }
        }
    }