PTA 03-树2 List Leaves java

Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10) which is the total number of nodes in the tree -- and hence the nodes are numbered from 0 to N−1. Then N lines follow, each corresponds to a node, and gives the indices of the left and right children of the node. If the child does not exist, a "-" will be put at the position. Any pair of children are separated by a space.

Output Specification:

For each test case, print in one line all the leaves' indices in the order of top down, and left to right. There must be exactly one space between any adjacent numbers, and no extra space at the end of the line.

具体题目链接:PTA | 程序设计类实验辅助教学平台

直接上代码

    public void t3() {
//        先构建出树来,然后层序遍历,层序遍历的时候判断该节点是否有子节点,如果没有,则输出
        List<String> list = new ArrayList<>();
        list.add("1 -");
        list.add("- -");
        list.add("0 -");
        list.add("2 7");
        list.add("- -");
        list.add("- -");
        list.add("5 -");
        list.add("4 6");

        List<String> index = new ArrayList<>();
        for (int i = 0; i < list.size(); i++) {
            for (String s : list.get(i).split(" ")) {
                if (!s.equals("-")) {
                    index.add(s);
                }
            }
        }
        int root = -1;
        for (int i = 0; i < list.size(); i++) {
            if (!index.contains(String.valueOf(i))) {
                root = i;
                break;
            }
        }

        List<String> tree = new ArrayList<>();
        tree.add(String.valueOf(root));
        diGui(tree, 0, list);

        System.out.println(tree);

        //遍历tree
        for (String s : tree) {
            //判断是否有子节点,无子节点则输出
            String s1 = list.get(Integer.parseInt(s));
            String[] split = s1.split(" ");
            if (split[0].equals("-") && split[1].equals("-")) {
                System.out.println(s);
            }

        }

    }

    private void diGui(List<String> tree, int level,List<String> list) {
        if (level >= list.size()) {
            return;
        }
        String[] split = list.get(Integer.parseInt(tree.get(level))).split(" ");

        for (String s1 : split) {
            if (!s1.equals("-")) {
                tree.add(s1);
            }
        }
        diGui(tree, level + 1, list);
    }

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值