最新下载
热门教程
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
不用递归实现论坛树型结构的算法
时间:2022-07-02 17:58:06 编辑:袖梨 来源:一聚教程网
jsp:useBean id="mybbs" scope="session" class="netzero.mydb" />
int intRowCount;
out.print("显示论坛树形结构");
out.print("
");
try {
String sql="select * from mybbslist order by rootid desc,depth,fid,bbsid";
ResultSet rs = mybbs.executeQuery(sql);
if (rs.next())
{
rs.last();
intRowCount=rs.getRow();
out.print("论坛树中有");
out.print(intRowCount);
out.print("个叶子节点");
rs.first();
int j=0;
int Depth = 0;
out.print("
}
}
rsDepth=rs.getInt("Depth");
if (rsDepth>Depth)
{
out.print("
}
else
{
out.print("数据库中无记录");
}
}catch (SQLException E) {
out.println("SQLException: " + E.getMessage());
out.println("SQLState: " + E.getSQLState());
out.println("VendorError: " + E.getErrorCode());
}
%>
try {
if(!mybbs.closeConn());
} catch (Exception ex) {
System.err.println("closeConn: " + ex.getMessage());
}
%>
int intRowCount;
out.print("显示论坛树形结构");
out.print("
");
try {
String sql="select * from mybbslist order by rootid desc,depth,fid,bbsid";
ResultSet rs = mybbs.executeQuery(sql);
if (rs.next())
{
rs.last();
intRowCount=rs.getRow();
out.print("论坛树中有");
out.print(intRowCount);
out.print("个叶子节点");
rs.first();
int j=0;
int Depth = 0;
out.print("
- ");
while(j
int rsDepth=rs.getInt("Depth");
if (rsDepth
for(int i=1;i
out.print("
}
}
rsDepth=rs.getInt("Depth");
if (rsDepth>Depth)
{
out.print("
- ");
- ");
String bbssubject=rs.getString("bbssubject");
out.print(bbssubject);
out.print(" ");
}
out.print("
Depth = rs.getInt("Depth");
j=j+1;
rs.next();
}
out.print("
}
else
{
out.print("数据库中无记录");
}
}catch (SQLException E) {
out.println("SQLException: " + E.getMessage());
out.println("SQLState: " + E.getSQLState());
out.println("VendorError: " + E.getErrorCode());
}
%>
try {
if(!mybbs.closeConn());
} catch (Exception ex) {
System.err.println("closeConn: " + ex.getMessage());
}
%>
相关文章
- 开放空间宁蒙有什么技能 09-15
- 小鸡舰队出击天空首领活动怎么玩 09-15
- 魔法工艺套装如何解锁使用 09-15
- 三国群英传策定九州资源地有什么打法技巧 09-15
- 下一站江湖2马夫人任务怎么完成 09-15
- 小鸡舰队出击终焉灵王队伍如何搭配 09-15