1 public static void main(String[] args) {
2 printMax(34,3,3,2,56.5);//用数组来算最大值
3 printMax(new double[]{1,2,3});//用数组来算最大值
4
5 }
6 public static void printMax(double... numbers){//创建一个printMax方法名 double... numbers为 可变参数
7 if (numbers.length == 0){//如果numbers.length 等于 0
8 System.out.println("No argument passed");//就输出 No argument passed
9 return;//结束循环
10 }
11 double result = numbers[0];//定义一个返回值为result 是一个组数类型
12
13 //排序
14 for (int i = 1; i < numbers.length; i++) { //i小于numbers.length为true 就i++ i 自增 1
15 if (numbers[i] > result){//比较谁最大
16 result = numbers[i]; //把最大的值赋给result
17 }
18
19 }
20 System.out.println("The max value is " + result);//for循环为false result就会输出最大值为max
21 }
1 package com.xl.exercise;
2
3 public class KebianDemo02 {
4 public static void main(String[] args) {
5 printMin(20,60,100,1,90.1,0.5,0.555,0.3);
6 printMin(new double[]{1,2,3,4,8,0.1,0});
7
8 }
9 public static void printMin(double... numbers){
10 if (numbers.length == 0){
11 System.out.println("NO");
12 return;
13 }
14 double result = numbers[0];
15 //最小排序
16 for (int i = 1; i < numbers.length; i++) {
17 if (numbers[i] < result){
18 result = numbers[i];
19
20 }
21
22 }
23 System.out.println("最小值："+result);
24 }
25 }
