您好,登錄后才能下訂單哦!
這篇文章主要講解了“Java中l(wèi)ist轉(zhuǎn)樹的應用”,文中的講解內(nèi)容簡單清晰,易于學習與理解,下面請大家跟著小編的思路慢慢深入,一起來研究和學習“Java中l(wèi)ist轉(zhuǎn)樹的應用”吧!
public class TreeNode { private String id; private String parentId; private String name; private List<TreeNode> children; public TreeNode(String id, String name, String parentId) { this.id = id; this.parentId = parentId; this.name = name; } public TreeNode(String id, String name, TreeNode parent) { this.id = id; this.parentId = parent.getId(); this.name = name; } public String getParentId() { return parentId; } public void setParentId(String parentId) { this.parentId = parentId; } public String getName() { return name; } public void setName(String name) { this.name = name; } public String getId() { return id; } public void setId(String id) { this.id = id; } public List<TreeNode> getChildren() { return children; } public void setChildren(List<TreeNode> children) { this.children = children; } @Override public String toString() { return "TreeNode{" + "id='" + id + '\'' + ", parentId='" + parentId + '\'' + ", name='" + name + '\'' + ", children=" + children + '}'; } } public class TreeBuilder { /** * 兩層循環(huán)實現(xiàn)建樹 * @param treeNodes 傳入的樹節(jié)點列表 * @return */ public static List<TreeNode> bulid(List<TreeNode> treeNodes) { List<TreeNode> trees = new ArrayList<TreeNode>(); for (TreeNode treeNode : treeNodes) { if ("0".equals(treeNode.getParentId())) { trees.add(treeNode); } for (TreeNode it : treeNodes) { if (it.getParentId() == treeNode.getId()) { if (treeNode.getChildren() == null) { treeNode.setChildren(new ArrayList<TreeNode>()); } treeNode.getChildren().add(it); } } } return trees; } }
感謝各位的閱讀,以上就是“Java中l(wèi)ist轉(zhuǎn)樹的應用”的內(nèi)容了,經(jīng)過本文的學習后,相信大家對Java中l(wèi)ist轉(zhuǎn)樹的應用這一問題有了更深刻的體會,具體使用情況還需要大家實踐驗證。這里是億速云,小編將為大家推送更多相關知識點的文章,歡迎關注!
免責聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點不代表本網(wǎng)站立場,如果涉及侵權請聯(lián)系站長郵箱:is@yisu.com進行舉報,并提供相關證據(jù),一經(jīng)查實,將立刻刪除涉嫌侵權內(nèi)容。