863 · Binary Tree Path Sum IV

class Solution:
    """
    @param nums: a list of integers
    @return: return an integer
    """
    def path_sum(self, nums: List[int]) -> int:
        d=defaultdict(dict)
        for num in nums:
            level,pos,val = num//100,(num//10)%10,num%10
            d[level][pos]=val
        vis = set()
        ans = 0
        for lev in range(4,0,-1):
            for pos in d[lev]  :
                if (lev,pos) in vis : continue
                for ht in range(lev,0,-1):
                    vis.add((ht,pos))
                    ans += d[ht][pos]
                    pos = (pos+1)>>1
        return ans