rainerosion/TreeDFS
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

dfs

Browse Source
This commit is contained in:
luming 2021-05-28 17:34:16 +08:00
parent 390e5d839b
commit bc966cf137
1 changed files with 23 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
src/main/java/Main.java
View File

@ -18,11 +18,32 @@ public class Main {
// 如何取值 id为 842362469438455808 的所有父id需要保持顺序
Deque<Long> stack = new ArrayDeque<>();
AtomicBoolean flag = new AtomicBoolean(false);
contractTypeDFS(842362469438455808L, typeTree, stack, flag);
// contractTypeDFS(841339223809196032L, typeTree, stack, flag);
Deque<Long> longs = treeFindPath(typeTree, 841338235396292608L, stack);
System.out.println(stack);
}
public static Deque<Long> treeFindPath(List<Type> tree, Long id, Deque<Long> stack){
Deque<Long> emptyStack = new ArrayDeque<>();
if(CollectionUtils.isEmpty(tree)){
return emptyStack;
}
for (Type type : tree) {
System.out.println(type.getId());
stack.push(type.getId());
if(Objects.equals(type.getId(),id)){
return stack;
}
if(CollectionUtils.isNotEmpty(type.getChildList())){
Deque<Long> longs = treeFindPath(type.getChildList(), id, stack);
if(!longs.isEmpty()){
return longs;
}
}
stack.pop();
}
return emptyStack;
}
public static List<Type> builldTree(List<Type> list){
ArrayList<Type> tree = Lists.newArrayList();
if(CollectionUtils.isNotEmpty(list)){