BST两数之和之中序遍历+两指针对撞

最新推荐文章于 2024-01-30 09:00:13 发布

root_Pi

最新推荐文章于 2024-01-30 09:00:13 发布

阅读量133

点赞数

本文链接：https://blog.csdn.net/root_Pi/article/details/100970988

版权

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def findTarget(self, root: TreeNode, k: int) -> bool:
        def inorder(root):
            if not root:
                return []
            return inorder(root.left)+[root.val]+inorder(root.right)
        numbers = sorted(inorder(root))
        n = len(numbers)
           
        i = 0
        j = n-1
        while i < j:
             if numbers[i] + numbers[j] > k:
                j -= 1
             elif numbers[i] + numbers[j] < k:
                i +=1
             else:
                return True
        return False