4.10 第六周作业

1. 定义长度位5的整型数组,输入他们的值,用冒泡排序后输出.

package lit;
import java.util.Scanner;
public class next1 {
    
     public static void main(String[] args){
            // TODO Auto-generated method stub
         int[] a=new int[5];
        Scanner input=new Scanner(System.in);
        System.out.println("输入五个数：");
        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++) {
             int x = 0;
             if(a[j] > a[j+1]){
                 x = a[j];
                 a[j]= a[j+1];
                 a[j+1] = x;
              }
           }
         }
         System.out.println("排序为：");
         for(int i=0;i<a.length;i++) {
             System.out.println(a[i]+"");
         }
     }
 }

2. 定义数组{34,22,35,67,45,66,12,33},输入一个数a,查找在数组中是否存在,如果存在,输出下标,不存在输出"not found"

package lit;
import java.util.Scanner;
public class next1 {
    
     public static void main(String[] args){
            // TODO Auto-generated method stub
         Scanner input=new Scanner(System.in);
         int [] a= {34,22,35,67,45,66,12,33};
         System.out.println("输入a: ");
         boolean x=false;
         int b=input.nextInt();
         for(int i=0;i<a.length;i++) {
             if(a[i]==b) {
                 System.out.println("在数组中存在"+"下标为: "+i);
                 x=true;
             }
         }
         if(x==false){
                 System.out.println("not found");
         
         }
     }

 }

3. 以矩阵的形式输出一个double型二维数组（长度分别为5、4，值自己设定）的值。

package text;

public class ZuoYe {
    public static void main(String[] args) {
        // TODO Auto-generated method stub
          double[][] a = {{1,2,3,4,5},{5,4,3,2,1},{0,9,8,7,6},{6,7,8,9,10},{16,17,18,19,20}};
            for(int i=0;i<4;i++) {
                for(int j=0;j<5;j++) {
                    System.out.print(a[i][j]+"   ");         
                }
                System.out.println();
            }
        }
    }

4.定义一个二维数组(长度分别为3,4,值自己设定),求该二维数组的最大值.

package text;

public class ZuoYe {
    public static void main(String[] args) {
        // TODO Auto-generated method stub
           int [][]a={{37,26,52,9},{13,25,1,8},{74,28,47,65}};
            int max=0;
            for(int i=0;i<a.length;i++){
                for(int j=0;j<a[i].length;j++){
                    if(a[i][j]>max){
                        max=a[i][j];
                    }
                }

            }
            System.out.println(max);
        }
    }