第六周

package tk;
import java.util.Scanner;
public class work {
    public static void main(String[] args) {
        Scanner input=new Scanner(System.in);
        System.out.println("数组的值");
        int[]a=new int[5];
        for(int i=0;i<a.length;i++){
            a[i]=input.nextInt();
        }for(int i=0;i<a.length-1;i++){
            for(int j=0;j<a.length-1-i;j++){
                if(a[j]>a[j+1]){
                    int temp = a[j];
                    a[j] = a[j+1];
                    a[j+1] = temp;
                }
            }
        }System.out.println("冒泡排序后输出");
        for(int i=0;i<a.length;i++){
            System.out.println(a[i]+" ");
        }

    }
}

package tk;
import java.util.Scanner;
public class work {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        boolean  z=false;
        int[] x=new int[]{34,22,35,67,45,66,12,33};
        System.out.print("请输出一个数");
        int a=sc.nextInt();
        for(int i=0;i<x.length;i++){
            if(x[i]==a){
                System.out.println("该数存在于数组中下标为"+i);
                 z=true;
            }
        } if(z==false){
            System.out.println("not found");
        }

    }
}

package tk;
import java.util.Scanner;
public class work {
    public static void main(String[] args) {
        double[][]arr={{1,2,3,4},{7,5,6,3},
                {1,4,8,6},{4,2,4,9},
                {8,5,2,7}};
        for(int i=0;i<arr.length;i++){
            System.out.println();
            for(int j=0;j<arr.length-1;j++){
                System.out.print(arr[i][j]+" ");
            }
        }

  }
}

package tk;
public class work {
    public static void main(String[] args){
    int arr[][]={{1,2,3},{4,5,6},
            {7,8,9},{10,11,12}};
    int max=arr[0][0];
    for(int i=0;i<arr.length;i++){
        for(int j=0;j<arr[i].length;j++){
            if(arr[i][j]>max){
                max=arr[i][j];
            }
        }
    }
    System.out.println("该二维数组的最大值为"+max);
  }
}