单排leetcode(python3)-在每行中找到最大值.py

class Solution:
    def largestValues(self, root):
        ans=[]
        def dfs(root,level):
            if not root:
                return
            if level>=len(ans):
                ans.append(float("-inf"))
            ans[level]=max(ans[level],root.val)
            dfs(root.left,level+1)
            dfs(root.right,level+1)
        dfs(root,0)
        return ans