第七次上机练习

package nn;
import java.util.Scanner;

public class nmz {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
           avg10();
    }

    public static void avg10() {
        int[] array = {88,66,84,87,78,80,98,94,82,95};
        int index = 0, sum = 0, temp = 0, avg = 0 ; 
        //找到最低分  冒泡排除，从小到大排列
        for (int i = 0; i < array.length - 1; i++) {
            for (int j = i + 1; j < array.length; j++) {
                if (array[j] < array[i]) {   //如果是大于号， 将是从大到小
                    temp = array[i];
                    array[i] = array[j];
                    array[j] = temp;
                }
            }
        }
        //求和
        while (array.length != index) {
            sum += array[index];
            index++;
        }
        do {
            sum = sum - array[0] - array[array.length-1];  //去掉最高分和最低分，
        } while (false);
        avg = sum / 8;
        System.out.println(avg);             
    }

}

package nn;
import java.util.Random;

public class nmz {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Random r = new Random();
          int [] [] num = new int [4] [4];
          for(int n=0;n<4;n++){
           for(int m=0;m<4;m++){
            num[n][m]=r.nextInt(9);
           }
          }
          printN(num);
          //检验数组第一个数的大小
          //第一轮把最大的数排在最下
          //第二轮把第二大的排在第三
          //第三轮把第三大的排在第二并且把最小的放在前面
          for(int n=0;n<3;n++){
           for(int m=0;m<3;m++){
           if(num[m][0]>num[m+1][0]){
             int [] temp= new int [4];
             for(int a=0;a<4;a++){
                 temp[a]=num[m+1][a];
             }
             for(int a=0;a<4;a++){
                 num[m+1][a]=num[m][a];
             }
             for(int a=0;a<4;a++){
                 num[m][a]=temp[a];
             }

            }
           }
           
           System.out.print("\nround"+(n+1)+"\n");
           printN(num);
          }
          System.out.print("\nfinal result:\n");
          printN(num);

         }
         //数组打印方法
         public static void printN(int [] [] a){
          for(int n=0;n<4;n++){

           for(int m=0;m<4;m++){
            System.out.print(a[n][m]+" ");
           }
           System.out.println();
          }
              
    }

}

package nn;
import java.util.Scanner;

public class nmz {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
         int a[]=new int[7];
         int i,m,j;
         fan:for(j=0;j <7;j++){//外循环实现随机生成每组7个数
         a[j]=(int)(Math.random()*35+1);
             m=a[j];
             if(j>=1){
                 for(i=0;i <j;i++)//内循环实现无重复
                   if(a[i]==m){
                   j--;
                   continue fan;
                     }
             }
             if(a[j] <10)
                 System.out.print("0"+a[j]+"  ");
                 else
                 System.out.print(a[j]+"  ");
           }
         }
 public static void main1 (String args[]){
     int n=Integer.parseInt(args[0]);
     System.out.println("中国福利彩票35选7");
     for(int i=0;i <n;i++){//循环调用方法实现输出n组数
     System.out.println();
       }
              
    }

}

package nn;
import java.util.Random;

public class nmz {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
         int[] arr = {46,56,37,28,64,88,89,92,49,66 };
            int max = arr[0];
            int min = arr[0];
            int ou = 0;
            for (int i = 0; i < arr.length; i++) {
                if (max < arr[i]) {
                    max = arr[i];
                }
                if (min > arr[i]) {
                    min = arr[i];
                }
                if (arr[i] % 2 == 0) {
                    ou++;
                }
            }
            System.out.println("最大值" + max);
            System.out.println("最小值" + min);
            System.out.println("偶数有" + ou);
            System.out.println("奇数有" + (10 - ou));    
    }

}

  

package nn;
import java.util.Random;

public class nmz {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
         int[] arr = {46,56,37,28,64,88,89,92,49,66 };
            int max = arr[0];
            int min = arr[0];
            int ou = 0;
            for (int i = 0; i < arr.length; i++) {
                if (max < arr[i]) {
                    max = arr[i];
                }
                if (min > arr[i]) {
                    min = arr[i];
                }
                if (arr[i] % 2 == 0) {
                    ou++;
                }
            }
            System.out.println("最大值" + max);
            System.out.println("最小值" + min);
            System.out.println("偶数有" + ou);
            System.out.println("奇数有" + (10 - ou));    
    }

}