gpt4 book ai didi

java - 采访 : How to traverse tree meeting two requirements below

转载 作者:塔克拉玛干 更新时间:2023-11-03 04:41:46 25 4
gpt4 key购买 nike

<分区>

最近,我被要求编写一个程序来解决下面的一个问题。
描述

Given a tree, two requirements,

  1. Traverse all nodes starting from root node. In the same time, you should guarantee every edge has been visited twice.
  2. Especially, leaf nodes should be visited as the order given.

输入

  • 第一行:整数K,代表节点数,K >= 1 && K <= 300
  • K-1行:每行两个整数,代表一条边(节点ID为1,2,3..,1代表根节点ID)。
  • 最后一行:所有叶节点顺序(叶节点应该被访问按此顺序)。

输出

If you can traverse the tree meeting two requirements above, outputs that node sequence. Otherwise, outputs -1

两个样本:

输入 1:
3
1 2
2 3
3
输出是:
1 2 3 2 1
input1

输入 2:
6
1 2
1 3
2 4
4 5
4 6
5 3 6
输出是:
-1
input2

25 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com