递归打印目录的树状结构

package com.liu.IO;

import java.io.File;

public class DiguiDemo {

/**

* @param args

*/

public static void main(String[] args) {

// TODO Auto-generated method stub

File file = new File("c:\\feicui");

printFileTree(file, 1);

}

public static void printFileTree(File file, int lev) {

File[] files = file.listFiles();

for (int i = 0; i < files.length; i++) {

if (files[i].isDirectory()) {

print(lev);

System.out.println(files[i].getName());

// if(files[i].listFiles().length!=0)

// ++lev;

printFileTree(files[i], ++lev);

--lev;

}

else

{

print(lev);

System.out.println(files[i].getName());

}

}

}

private static void print(int lev) {

String string = "";

for (int i = 0; i < lev; i++) {

string += " - ";

}

System.out.print(string);

}

}