zoukankan      html  css  js  c++  java
  • 663. Equal Tree Partition

    package LeetCode_663
    
    import main.TreeNode
    import java.util.*
    
    /**
     * 663. Equal Tree Partition
     * (locked by leetcode)
     * https://www.lintcode.com/problem/equal-tree-partition/description
     *
     * Given a binary tree with n nodes, your task is to check if it's possible to partition the tree to two trees which have the equal sum of values after removing exactly one edge on the original tree.
    
    Example 1:
    Input:
       5
      / 
     10 10
       /  
      2   3
    Output: True
    
    Explanation:
      5
     /
    10
    Sum: 15
    
      10
     /  
    2    3
    Sum: 15
     * */
    class Solution {
        /*
        * solution: DFS,
        * use stack to record the sum of every subtree
        * Time complexity:O(n), Space complexity:O(n)
        * */
    
        private val stack = Stack<Int>()
    
        fun checkEqualTree(root: TreeNode?): Boolean {
            if (root == null) {
                return true
            }
            sum(root)
            val total = stack.pop()
            if (total % 2 == 0) {
                for (item in stack) {
                    if (item == total / 2) {
                        return true
                    }
                }
            }
            return false
        }
    
        private fun sum(root: TreeNode?): Int {
            if (root == null) {
                return 0
            }
            val sum = sum(root.left) + sum(root.right) + root.`val`
            stack.push(sum)
            return stack.peek()
        }
    }
  • 相关阅读:
    MySQL 优化
    Log4j2 中format增加自定义的参数
    MySQL 索引
    Linux中top和free命令详解(转)
    JAVA面试题
    Servlet3.0的可插拔功能
    开放通用Api,总有你喜欢的
    Git常用命令
    支付宝无法回调或者回调后验签失败
    Promise
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/13043160.html
Copyright © 2011-2022 走看看