java 基础部分(求数组最大值)

定义一个函数来求数组的最大值(无Scanner)

package com.company;

import java.util.Scanner;

//循环条件语句,先将扫描到的最大值赋值给max,然后不停的迭代,直到数组最后一个元素
public class CalculateMaxApi {
    public static double MaxByFunction(double numberlist[]){
        double max = numberlist[0];
        for(int i=0;i<numberlist.length;i++){
            if(numberlist[i] >max)
                max =numberlist[i];

        }
        return max;

    }
    //三元运算法,定义一个num,如果数组里的数小于num,num不变,若大于num则num=numberlist【i】
    public static  double MaxBySanyuan(double numberlist[]){
        double num =numberlist[0];
        for(int i=0;i<numberlist.length;i++){
            num=(numberlist[i] <num?num:numberlist[i]);
        }
        return num;
    }
    //调用函数
    public  static  void  main(String[] args){
        double[] numberlist={1,2,3,4,5,6,7,8};

        System.out.println(MaxByFunction(numberlist));
        System.out.println(MaxBySanyuan(numberlist));
    }


}

求从键盘输入的数组的最大值

package com.company;

import java.util.Arrays;
import java.util.Scanner;

public class TheNextMax {
    public  static  void  main(String[] args){
        int[] a=new int[8];
        Scanner scanner=new Scanner(System.in);
        System.out.println("请输入数,用空格隔开");
        for(int i=0;i<a.length;i++)
        {
            a[i]=scanner.nextInt();
        }
        int max=a[0];

        Arrays.sort(a);
        for (int i =0; i<a.length; i++){
            System.out.print(a[i]);
            if(a[i]>max){
                max=a[i];
            }
        }
        System.out.println("\n最大的数为"+max);

    }
}
最简单的两个数比较

import java.util.Scanner;

public class Main {
    private static Scanner scanner;

    public static void main(String[] args) {
        scanner=new Scanner(System.in);
        System.out.println("请输入a");
        int a=scanner.nextInt();
        System.out.println("请输入b");
        int b=scanner.nextInt();
        if(a>b)
            System.out.print("最大的数是:"+a);
        else
            System.out.println("最大的数是:"+b);



    }
}

猜你喜欢

转载自blog.csdn.net/qq_37913435/article/details/81179542