public static int test(int []num,int i,int max)
{
if(i<=0)
{
return max;
}
if(num[i]>max)
{
max=num[i];
}
return test(num,i-1,max);
}不知道可不可以,没试
{
if(i<=0)
{
return max;
}
if(num[i]>max)
{
max=num[i];
}
return test(num,i-1,max);
}不知道可不可以,没试
调试欢乐多
static Integer []num = {11,3,6,20,5,9,78,3,68,99};
public FindMax() {
} public static void main(String[] args) {
System.out.print ("The array is [");
for (Integer i : num)
System.out.print (i+",");
System.out.println ("]. The largest one in this array is "+find(num.length-1));
}
//递归方法
public static int find(int t){
if (t == 0){
return num[t];
}else{
return (num[t]>find(t-1))?num[t]:find(t-1);
}
}
}大概是这个意思吧