【无标题】

最新推荐文章于 2024-11-04 20:33:37 发布

Pagridae就是木木挺

最新推荐文章于 2024-11-04 20:33:37 发布

阅读量66

点赞数 3

文章标签： java 算法数据结构

本文链接：https://blog.csdn.net/2301_80646062/article/details/136952675

版权

package com.Jsucs;
// 给一个数组要求我们把他的第3位到第7位赋值给一个新的数组,从from开始到down结束
// 包括from，但是不包括down；
public class Useway02 {
    public static void main(String[] args) {
       int[] arr= {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
        getarr( arr, 3, 7);
    }

    public static void getarr( int[] arr, int from, int down) {
        int[] arrs = new int[down - from];
        int count = 0;
        System.out.print("[ ");
        for (int i = from; i < down; i++) {
            arrs[ count ] = arr[i];
            if(count == down-1){
                System.out.print( arrs[count] );
            }else{
                System.out.print( arrs[ count ] + " ");
            }
            count++;
        }
        System.out.println("]");
    }
}

package com.Jsucs;
//在数列中查找一个数，如果找到了就返回一个ture，否则就返回一个false
public class Useway {
    public static void main(String[] args) {
int[] arr = {12, 23, 34, 45, 56, 67, 78, 89, 90};
        System.out.println(arry( arr, 34));
    }

    public static boolean arry(int[] arr, int num) {
        for (int i = 0; i < arr.length; i++) {
            if( arr[i] == num){
                return true;
            }
        }
        return false;
    }
}

package com.Jsucs;

import java.util.Scanner;

public class useway03 {
    public static void main(String[] args) {
       int[] socerArr = getSocres();
        for (int i = 0; i < socerArr.length; i++) {
            System.out.println(socerArr[i]);
        }
        int max = getMax(socerArr);
        int min = getMin(socerArr);
        int sum = getSum(socerArr);
     int avg =  (sum - max -min)/(socerArr.length-2);
        System.out.println(avg);
    }


    public static int getMax(int[] scoreArr) {
        int max = scoreArr[0];
        for (int i = 0; i < scoreArr.length; i++) {
            if(scoreArr[i] < max){
                max = scoreArr[i];
            }
        }
        return max;
    }
    public static int getMin(int[] scoreArr) {
        int min = scoreArr[0];
        for (int i = 0; i < scoreArr.length; i++) {
            if(scoreArr[i] < min){
                min = scoreArr[i];
            }
        }
        return min;
    }
    public static int getSum(int[] scoreArr) {
        int sum = 0;
        for (int i = 0; i < scoreArr.length; i++) {
            sum = sum +scoreArr[i];
        }
        return sum;
    }
    public static int[] getSocres(){
        int[] scores = new int[6];
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < scores.length; ) {
            System.out.println("请输入评委打分");
            int score= sc.nextInt();
            if(score >= 0 && score <= 100){
                scores[i] = score;
                i++;
            }else {
                System.out.println("成绩超出范围，当前i为：" + i);
            }
        }
        return scores;
    }
}