g0501_0600.s0560_subarray_sum_equals_k.solution.ts 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) #2023_09_30_Time_70_ms_(92.45%)_Space_52.7_MB_(27.70%)

function subarraySum(nums: number[], k: number): number {
    let tempSum: number = 0
    let ret: number = 0
    const sumCount: Map = new Map()
    sumCount.set(0, 1)
    for (const num of nums) {
        tempSum += num
        if (sumCount.has(tempSum - k)) {
            ret += sumCount.get(tempSum - k)!
        }
        if (sumCount.has(tempSum)) {
            sumCount.set(tempSum, sumCount.get(tempSum)! + 1)
        } else {
            sumCount.set(tempSum, 1)
        }
    }
    return ret
}

export { subarraySum }