[leetcode] 113. Path Sum II 파이썬 코드

https://leetcode.com/problems/path-sum-ii/description/

 

 

class Solution(object):
    def pathSum(self, root, targetSum):
        result = []
        if not root: return result
        
        def dfs(root, curr_sum, curr_list):
            curr_sum += root.val
            temp = curr_list + [root.val]

            if root.left:
                dfs(root.left, curr_sum, temp)
            if root.right:
                dfs(root.right, curr_sum, temp)
            if not root.left and not root.right and curr_sum == targetSum:
            # leaf node까지 왔을 때 targetSum과 같은지 체크 
                result.append(temp)

        temp = []
        dfs(root, 0, temp)
        return result