help! Here is my code and I have implemented same idea as others but my code only beats 15% of python solutions

  • 0

    here is the code

    # Definition for a binary tree node.
    # class TreeNode(object):
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None
    class Solution(object):
        def __init__(self):
            self.dict = {}
        def helper(self, root):
            sum = root.val
            if root.left:
                sum += self.helper(root.left)
            if root.right:
                sum += self.helper(root.right)
            self.dict[sum] = self.dict.get(sum,0) + 1
            return sum
        def findFrequentTreeSum(self, root):
            :type root: TreeNode
            :rtype: List[int]
            if root:
                return []
            frequent = max(self.dict.values())
            return [i for i,v in self.dict.items() if v==frequent]

Log in to reply

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