Skip to content

Latest commit

 

History

History
192 lines (158 loc) · 4.59 KB

README_EN.md

File metadata and controls

192 lines (158 loc) · 4.59 KB

653. Two Sum IV - Input is a BST

中文文档

Description

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

 

Example 1:

Input: root = [5,3,6,2,4,null,7], k = 9
Output: true

Example 2:

Input: root = [5,3,6,2,4,null,7], k = 28
Output: false

Example 3:

Input: root = [2,1,3], k = 4
Output: true

Example 4:

Input: root = [2,1,3], k = 1
Output: false

Example 5:

Input: root = [2,1,3], k = 3
Output: true

 

Constraints:

  • The number of nodes in the tree is in the range [1, 104].
  • -104 <= Node.val <= 104
  • root is guaranteed to be a valid binary search tree.
  • -105 <= k <= 105

Solutions

Python3

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def findTarget(self, root: TreeNode, k: int) -> bool:
        def find(node):
            if not node:
                return False
            if k - node.val in nodes:
                return True
            nodes.add(node.val)
            return find(node.left) or find(node.right)

        nodes = set()
        return find(root)

Java

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    private Set<Integer> nodes;

    public boolean findTarget(TreeNode root, int k) {
        nodes = new HashSet<>();
        return find(root, k);
    }

    private boolean find(TreeNode node, int k) {
        if (node == null) {
            return false;
        }
        if (nodes.contains(k - node.val)) {
            return true;
        }
        nodes.add(node.val);
        return find(node.left, k) || find(node.right, k);
    }
}

C++

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    unordered_set<int> nodes;

    bool findTarget(TreeNode* root, int k) {
        return find(root, k);    
    }

    bool find(TreeNode* node, int k) {
        if (node == nullptr) {
            return false;
        }
        if (nodes.count(k - node->val)) {
            return true;
        }
        nodes.insert(node->val);
        return find(node->left, k) || find(node->right, k);
    }
};

Go

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func findTarget(root *TreeNode, k int) bool {
	nodes := make(map[int]bool)
	var find func(node *TreeNode, k int) bool
	find = func(node *TreeNode, k int) bool {
		if node == nil {
			return false
		}
		if nodes[k-node.Val] {
			return true
		}
		nodes[node.Val] = true
		return find(node.Left, k) || find(node.Right, k)
	}
	return find(root, k)

}

...