Share my fast and easy python 72ms solution

  • 0

    This solution is using the sliding window and inorder traversal. I maintain a window of size k to record the elements in the tree in ascending order. If a new element which needs to be added is closer to target than the first element in the window, we pop the first one and push the current element; if not, we just break the inorder traversal to return our result.

    class Solution(object):
    def closestKValues(self, root, target, k):
        :type root: TreeNode
        :type target: float
        :type k: int
        :rtype: List[int]
        if k == 0 or not root: return []
        stk, cur, result, count = [], root, [], 0
        #inorder traversal of the tree
        while len(stk) != 0 or cur != None:
            if cur != None:
                cur = cur.left
                cur = stk.pop()
                #if the window smaller than k, we just append the element
                if count < k:
                #if not, we check whether element(first one in the window or the current one) is closer to the target
                    if abs(result[0] - target) > abs(cur.val - target):
                count += 1
                cur = cur.right
        return result

  • 0

    Why do you compare the current node's closeness to the first node in the window?

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.