[LeetCode] Two Sum IV - Input is a BST

snifes 發布于2019-08-15 15:59 / 2234人閱讀

Problem

Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.

Example

Example 1:
Input:

Target = 9

Output: True
Example 2:
Input:

Target = 28

Output: False

Solution

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean findTarget(TreeNode root, int k) {
        Queue queue = new LinkedList();
        Set set = new HashSet<>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            TreeNode cur = queue.poll();
            if (set.contains(k-cur.val)) return true;
            set.add(cur.val);
            if (cur.left != null) queue.offer(cur.left);
            if (cur.right != null) queue.offer(cur.right);
        }
        return false;
    }
}

GPU云服務器云服務器 two-sum IV python iv BST

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://m.specialneedsforspecialkids.com/yun/69362.html

Leetcode PHP題解--D89 653. Two Sum IV - Input is a B

摘要：思路思路遍歷的時候，先把節點存起來，并且與每一個值相加，判斷是否等于所需值。用函數判斷與所求數字之差是否在數組內。否則，遍歷子節點。最終代碼若覺得本文章對你有用，歡迎用愛發電資助。 D89 653. Two Sum IV - Input is a BST 題目鏈接 653. Two Sum IV - Input is a BST 題目分析給定一個二叉樹以及一個目標數字，判斷能不能通過...

HtmlCssJs 2019-07-01 14:01 評論0 收藏0
前端 | 每天一個 LeetCode

摘要：在線網站地址我的微信公眾號完整題目列表從年月日起，每天更新一題，順序從易到難，目前已更新個題。這是項目地址歡迎一起交流學習。這篇文章記錄我練習的 LeetCode 題目，語言 JavaScript。在線網站：https://cattle.w3fun.com GitHub 地址：https://github.com/swpuLeo/ca...我的微信公眾號： showImg(htt...

張漢慶 2019-08-23 13:42 評論0 收藏0
11.leetcode Range Sum of BST

1. Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive). The binary search tree is guaranteed to have unique values. #### 1. 例子 Inp...

shiweifu 2019-08-23 16:57 評論0 收藏0
[LeetCode] 776. Split BST

Problem Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes that are all smaller or equal to the target value, whil...

baiy 2019-08-16 13:45 評論0 收藏0
LeetCode 272 Closest Binary Tree Traversal II 解題思路

摘要：原題網址題意在二叉搜索樹當中找到離最近的個數。解題思路由于二叉搜索數的中序遍歷是有序的，比如例子中的樹，中序遍歷為。原題網址：https://leetcode.com/problems... Given a non-empty binary search tree and a target value, find?k?values in the BST that are closes...

Youngdze 2019-08-16 13:26 評論0 收藏0