代码随想录Day018 | Leetcode 513.找树左下角的值 、Leetcode 112.路径总和、Leetcode 106.从中序与后序遍历序列构造二叉树

513.找树左下角的值

class Solution {
    public int findBottomLeftValue(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        TreeNode curEndNode = root;
        TreeNode nextEndNode = null;

        int cnt = 0;
        while (!queue.isEmpty()) {
            TreeNode node = queue.poll();
            if (node.left != null) {
                queue.add(node.left);
                nextEndNode = node.left;
            }
            if (node.right != null) {
                queue.add(node.right);
                nextEndNode = node.right;
            }

            if (curEndNode == node) {
                curEndNode = nextEndNode;
                cnt++;
            }

        }
//        System.out.println("cnt = " + cnt);

        curEndNode = root;
        queue.add(root);

        int curLevel = 0;
        int res = 0;
        while (!queue.isEmpty()) {
            TreeNode node = queue.poll();
            if (curLevel == cnt - 1) {
                res = node.val;
                break;
            }
            if (node.left != null) {
                queue.add(node.left);
                nextEndNode = node.left;
            }
            if (node.right != null) {
                queue.add(node.right);
                nextEndNode = node.right;
            }

            if (curEndNode == node) {
                curEndNode = nextEndNode;
                curLevel++;
            }

        }


        return res;
    }
}

112.路径总和

class Solution {
    int[] res = {Integer.MAX_VALUE};

    public boolean hasPathSum(TreeNode root, int targetSum) {
        if (root == null) {
            return false;
        }
        int cur = 0;
        //targetSum为0时
        // cur和targetSum同时加root.val
        if (targetSum == 0) {
            cur = root.val;
            targetSum = root.val;

        }

        int i = pathSum(root, cur, targetSum);
//        System.out.println("res = " + res[0]);
        if (res[0] == targetSum) {
            return true;
        }
        return false;
    }

    public int pathSum(TreeNode node, int cur, int target) {

        //应该先收集再判断，因为判断的是路径，
        //相当于要到叶子节点
//        if (cur > target) {
//            return 0;
//        }
//        if (cur == target) {
//            res[0] = target;
//            return target;
//        }
        if (node == null) {

            return cur;
        }

        cur += node.val;
        int leftSum = pathSum(node.left, cur, target);
        int rightSum = pathSum(node.right, cur, target);
        //判断是否是叶子节点
        if (node != null && node.left == null && node.right == null) {
            if (cur > target) {
                return 0;
            }
            if (cur == target) {
                res[0] = target;
                return target;
            }
            return cur;
        }
        cur -= node.val;


        return cur;
    }
}

106.从中序与后序遍历序列构造二叉树

class Solution {
    //做不出来，先看一下

    Map<Integer, Integer> map;  // 方便根据数值查找位置
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        map = new HashMap<>();
        for (int i = 0; i < inorder.length; i++) { // 用map保存中序序列的数值对应位置
            map.put(inorder[i], i);
        }

        return findNode(inorder,  0, inorder.length, postorder,0, postorder.length);  // 前闭后开
    }

    public TreeNode findNode(int[] inorder, int inBegin, int inEnd, int[] postorder, int postBegin, int postEnd) {
        // 参数里的范围都是前闭后开
        if (inBegin >= inEnd || postBegin >= postEnd) {  // 不满足左闭右开，说明没有元素，返回空树
            return null;
        }
        int rootIndex = map.get(postorder[postEnd - 1]);  // 找到后序遍历的最后一个元素在中序遍历中的位置
        TreeNode root = new TreeNode(inorder[rootIndex]);  // 构造结点
        int lenOfLeft = rootIndex - inBegin;  // 保存中序左子树个数，用来确定后序数列的个数
        root.left = findNode(inorder, inBegin, rootIndex,
                postorder, postBegin, postBegin + lenOfLeft);
        root.right = findNode(inorder, rootIndex + 1, inEnd,
                postorder, postBegin + lenOfLeft, postEnd - 1);

        return root;
    }
}