大家好，又见面了，我是你们的朋友全栈君。如果您正在找激活码,请点击查看最新教程,关注关注公众号 “全栈程序员社区” 获取激活教程,可能之前旧版本教程已经失效.最新Idea2022.1教程亲测有效,一键激活。
Jetbrains全系列IDE使用 1年只要46元 售后保障 童叟无欺
###Java递归删除文件
public static void main(String[] args) {
File file = new File(“D:\\dir”);
recursiveDelete(file);
}
###recursiveDelete方法
private static void recursiveDelete(File file) {
if (file.isDirectory()) {
File[] list = file.listFiles();
for (File f : list) {
recursiveDelete(f);
}
// 删除完文件夹内的文件后删除自身
file.delete();
} else {
file.delete();
}
}
###=================================================================== ###同理，递归删除数据库里的商品目录
public int deleteGoodsCategory(Long goodsCategoryId) {
return recursive(goodsCategoryId);
}
private int recursive(Long goodsCategoryId) {
int r = 0;//此统计结果不准确
if (hasSubCategory(goodsCategoryId)) {
//删除子类目
List list = goodsCategoryDao.selectSubGoodsCategory(goodsCategoryId);
for (GoodsCategory g : list) {
recursive(g.getId());
}
goodsCategoryDao.deleteByPrimaryKey(goodsCategoryId);//删除完子类目后删除自身
r++;
} else {
goodsCategoryDao.deleteByPrimaryKey(goodsCategoryId);
r++;
}
return r;
}
public boolean hasSubCategory(Long goodsCategoryId) {
return goodsCategoryDao.hasSubCategory(goodsCategoryId) > 0;
}
###goodsCategoryDao
int deleteByPrimaryKey(Long id);
//delete from xy_goods_category where id = #{id}
int hasSubCategory(Long goodsCategoryId);
// select count(1) from xy_goods_category where parent_id = #{goodsCategoryId}
/**
* 某个目录的子目录列表
*/
List selectSubGoodsCategory(Long goodsCategoryId);
// select * from xy_goods_category where parent_id = #{goodsCategoryId}
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/192092.html原文链接：https://javaforall.net
