转载自:https://blog.csdn.net/zy332719794/article/details/80164205
递归删除
/**
* 递归删除文件夹及子文件
* @param file
* @return
*/
private static boolean delefile(File file){
if(file.isDirectory()){
File[] files = file.listFiles();
for (int i = 0; i < files.length; i++) {
boolean flag = delefile(files[i]);
if(!flag){
return false;
}
}
}
return file.delete();
}
/**
* 删除文件夹及其子文件(栈方式)
**/
public static boolean deleteDirectory(File dir) {
Stack<File> stackFiles = new Stack<File>();
stackFiles.push(dir);
while (stackFiles.size() > 0) {
File currentFile = stackFiles.peek();
File[] subFiles = currentFile.listFiles();
for (int i = 0; i < subFiles.length; i++) {
if (subFiles[i].isFile()) {
if (!subFiles[i].delete()) {
return false;
}
} else {
stackFiles.push(subFiles[i]);
}
}
if (currentFile == stackFiles.peek()) {
if (!currentFile.delete()) {
return false;
}
stackFiles.pop();
}
}
return true;
}