1. 什么是递归?
递归算法是一种直接或间接调用自身函数或者方法的算法。Java递归算法是基于Java语言实现的递归算法。
public void updateVertex(Integer userid,Integer hierarchy,Integer vertexUserId,Integer num,Integer count1) {
if (hierarchy > 0 && hierarchy > hierarchy - 1) {
num++;
List userIdList1 = zsUserRelaMapper.findDirectUserId(userid);
if (userIdList1.size() > 0 && count1 < 1) {
redisTemplate.opsForValue().set("DDYH"+userid,userIdList1,2, TimeUnit.MILLISECONDS);
for (int i = 0; i < userIdList1.size(); i++) {
log.info("【顶点设置】顶点用户id:"+vertexUserId+",当前用户:"+userid+",级数:"+num);
//查询当前用户是不是顶点用户
count1 = super.baseMapper.checkVertexUser(userIdList1.get(i));
//修改用户顶点id,级数
ZsUserEntity user1 = userManageMapper.findUser(userIdList1.get(i));
user1.setVertexUserId(vertexUserId); //顶点id
user1.setHierarchyNum(num); //级数为1
userManageMapper.updateVertex(user1);
//调用自身当前方法
updateVertex(userIdList1.get(i), hierarchy - 1, vertexUserId, num,count1);
}
}
}
}



