用递归算法求出最大值:代码如下:
public class MaxNumber{
public MaxNumber(){
}
public static int getMaxnumber(int[] num,int leng){
int max=0;
if(leng==1){
max=num[0];
}else{
max=num[leng];
int t=getMaxnumber(num,leng-1);
if(t>max){
max=t;
}
}
return max;
}
public static void main(String[] args){
int[] num=new int[]{1,2,3,4,5,6,7,8,9,50,14,45};
System.out.println (getMaxnumber(num,num.length-1));
}
}
用递归算法显示出文件的例表:代码如下:
import java.io.*;
public class FileDir{
public FileDir(){
}
public static void showfilepath(String filepath){
File file=new File(filepath);
if(file.isDirectory()){
File[] f=file.listFiles();
for(int j=0;j if(f[j].isDirectory()){
showfilepath(f[j].getPath());
}
if(f[j].isFile()){
System.out.println (f[j].getPath());
}
}
}
if(file.isFile()){
System.out.println (file.getPath());
}
}
public static void main(String[] srgs){
showfilepath("e:");
}
}