import java.util.Scanner;
public class Digui3 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[]aa = new int[n];
for (int i = 0; i < n; i++) {
aa[i]=sc.nextInt();
}
int sum = fun(aa[0],1,aa);
System.out.println(sum);
}
public static int fun(int max,int index,int[]aa) {
if(max>aa[index]) {
max = max;
}else {
max = aa[index];
}
if(index == aa.length-1) {
return max;
}else {
return fun(max,index+1,aa);
}
}
}
Java如何用递归求数组最大值
最新推荐文章于 2024-03-17 08:45:43 发布