Two sum IV - Input is a BST

最新推荐文章于 2024-01-11 21:58:49 发布

Goofiness

最新推荐文章于 2024-01-11 21:58:49 发布

阅读量189

点赞数

分类专栏： leetcode 文章标签： twosum leetcode python BST

本文链接：https://blog.csdn.net/byr_wy/article/details/82873014

版权

leetcode 专栏收录该内容

232 篇文章 0 订阅

订阅专栏

Two sum IV：

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：

Input: 
    5
   / \
  3   6
 / \   \
2   4   7

Target = 9

Output: True

Solution：

class Solution:
    def findTarget(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: bool
        """
        if not root:
            return False
        bfs, s = [root], set()
        for i in bfs:
            if k-i.val in s:
                return True
            if i.left:
                bfs.append(i.left)
            if i.right:
                bfs.append(i.right)
            s.add(i.val)
        return False

Result