我有一堆父母/孩子对,我想尽可能地变成分层树结构。因此,例如,这些可能是配对:
Child : Parent
H : Ga
F : G
G : D
E : D
A : E
B : C
C : E
D : NULL
Z : Y
Y : X
X: NULL
需要将其转换为(多个)分层树:
D
├── E
│ ├── A
│ │ └── B
│ └── C
└── G
| ├── F
| └── H
|
X
|
└── Y
|
└──Z
在Java中,我如何从包含child => parent对的arrayList转到这样的Tree?
我需要此操作的输出是arrayList包含两个元素D和X,每个元素依次具有其子级列表,而子级又包含子级列表,依此类推
public class MegaMenuDTO {
private String Id;
private String name;
private String parentId;
private List childrenItems=new ArrayList();
public String getId() {
return Id;
}
public void setId(String id) {
Id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getParentId() {
return parentId;
}
public void setParentId(String parentId) {
this.parentId = parentId;
}
public List getChildrenItems() {
return childrenItems;
}
public void setChildrenItems(List childrenItems) {
this.childrenItems = childrenItems;
}
}
我的第一次尝试是
private void arrangeMegaMenuTree(MegaMenuDTO grandParent,
MegaMenuDTO parent, List children) {
for (MegaMenuDTO child : children) {
if (child.getParentId().equals(parent.getId())) {
arrangeMegaMenuTree(parent, child, children);
}
}
if (!grandParent.getId().equals(parent.getId())) {
grandParent.getChildrenItems().add(parent);
// children.remove(parent);
}
}
再试一次
private List arrangeMegaMenuTree(MegaMenuDTOparent,ListmenuItems) {
for (MegaMenuDTO child : menuItems) {
if (parent.getId().equals(child.getId())) {
continue;
}
if (hasChildren(child, menuItems)) {
parent.setChildrenItems(arrangeMegaMenuTree(child, menuItems
.subList(menuItems.indexOf(child), menuItems.size())));
} else {
List tempList = new ArrayList();
tempList.add(child);
return tempList;
}
}
return null;
}
private boolean hasChildren(MegaMenuDTO parent, List children) {
for (MegaMenuDTO child : children) {
if (child.getParentId().equals(parent.getId())) {
return true;
}
}
return false;
}