Ruby's Louvre

每天学习一点点算法

导航

统计

leetcode 1214 Two Sum BSTs

function rob(a, b, target) {
    var hash = {}
    var stack = [a]
    while (queue.length) {
        var node = stack.pop()
        stack[target - node.val] = 1;
        if (node.left) {
            stack.push(node.left)
        }
        if (node.right) {
            stack.push(node.right)
        }

    }
    var stack = [b]
    while (queue.length) {
        var node = stack.pop()
        if (stack[node.val] == 1) {
            return true
        }
        if (node.left) {
            stack.push(node.left)
        }
        if (node.right) {
            stack.push(node.right)
        }
    }
    return false
}

posted on 2020-01-16 22:00  司徒正美  阅读(885)  评论(0编辑  收藏