leetcode--前缀和

560. 和为K的子数组

class Solution(object):
    def subarraySum(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        res = 0
        hash = collections.defaultdict(int)
        hash[0] = 1
        pre_sum = 0
        for num in nums:
            pre_sum += num
            #注意先 res += hash[pre_sum-k]再hash[pre_sum] += 1，不能将2者顺序交换，例如nums=[1],k=0
            res += hash[pre_sum-k]
            hash[pre_sum] += 1
            
        return res

437. 路径总和 III

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def __init__(self):
        self.res = 0
    def pathSum(self, root: TreeNode, targetSum: int) -> int:
        pre_sum_dic = collections.defaultdict(int)
        # pre_sum_dic[0] = 1
        self.dfs(root, 0, pre_sum_dic, targetSum)
        return self.res
    def dfs(self, root, pre_sum, pre_sum_dic, targetSum):
        if not root:
            return
        pre_sum += root.val
        pre_sum_dic[pre_sum] += 1
        self.res += pre_sum_dic[pre_sum-targetSum]
        self.dfs(root.left, pre_sum, pre_sum_dic, targetSum)
        self.dfs(root.right, pre_sum, pre_sum_dic, targetSum)
        pre_sum -= root.val
        pre_sum_dic[pre_sum] -= 1

238. 除自身以外数组的乘积

class Solution:
    def productExceptSelf(self, nums: List[int]) -> List[int]:
        n = len(nums)
        res = [1] * n
        tem = 1
        for i in range(1, n):
            res[i] = nums[i-1] * res[i-1]
        for j in range(n-2, -1, -1):
            tem *= nums[j+1]
            res[j] *= tem
        return res