g0501_0600.s0560_subarray_sum_equals_k.Solution.py Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

# #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array
# #Big_O_Time_O(n)_Space_O(n) #2024_06_07_Time_224_ms_(72.29%)_Space_19.4_MB_(91.64%)

from collections import defaultdict

class Solution:
    def subarraySum(self, nums: List[int], k: int) -> int:
        tempSum = 0
        ret = 0
        sumCount = defaultdict(int)
        sumCount[0] = 1
        
        for i in nums:
            tempSum += i
            if tempSum - k in sumCount:
                ret += sumCount[tempSum - k]
            sumCount[tempSum] += 1
        
        return ret