第六次java作业

//定义长度位5的整型数组  输入他们的值 使用冒泡排序后输出
package leibianliang;
public class Leibianliang {

    public static void main(String[] args) {
        // TODO 自动生成的方法存根
        int[] a= {12,5,54,32,78};
        System.out.println(" 原来的数组");
        for(int x=0;x<a.length;x++)
        {
            System.out.print("  ");
            System.out.print(a[x]);
        }
        int temp=0;
        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]) {
                    temp = a[j];
                    a[j] = a[j+1];
                    a[j+1] = temp;
                }
            }

        }
        //输出结果
        System.out.println("  ");
        System.out.println("  现在的数组");
        for(int i = 0;i<a.length;i++){
            System.out.print("  ");
            System.out.print(a[i]);
        }
        }
        
    }

//定义数组查找 且输出下标
package hanshudiaoyong;
import java.util.*;
import javax.swing.plaf.synth.SynthSpinnerUI;
public class Canshuduotai {
    public static void main(String[] args) {
        // TODO 自动生成的方法存根
         Scanner input=new Scanner(System.in);
            int[] x={34,22,35,67,45,66,12,33};
            System.out.println("请输入一个数:");
            int a=input.nextInt();
            for(int i=0;i<x.length;i++){
                if(x[i]==a){
                    System.out.println("该数存在于数组中,下标为"+i);
                }else{
                    System.out.println("not found");
                }break;
       
    }
    }
}

//以矩阵的形式输出二维数组
package hanshudiaoyong;
import java.util.*;
public class Canshuduotai {
    public static void main(String[] args) {Scanner sc = new Scanner(System.in);
    int[][] a = new int[5][4];
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 4; j++) {
            a[i][j] = sc.nextInt();
        }
    }
    System.out.println("你输入的数组为:");
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 4; j++) {
            System.out.print(a[i][j]);
        }
        System.out.println();
    }
    }
}

//定义一个二维数组
package hanshudiaoyong;
import java.util.*;
public class Canshuduotai {
    public static void main(String[] args) {
        // TODO 自动生成的方法存根
        Scanner sc = new Scanner(System.in);
        int[][] a = new int[5][4];
        int max=0;
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 4; j++) {
                a[i][j] = sc.nextInt();
            }
        }
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length-1; j++) {
                if(max<a[i][j]){
                    max=a[i][j];
                }
            }
        }
        System.out.println("最大值是:"+max);
    }
}