LeetCode 560. Subarray Sum Equals K

最新推荐文章于 2024-01-11 20:27:09 发布

taoqick

最新推荐文章于 2024-01-11 20:27:09 发布

阅读量165

点赞数

分类专栏：智力题算法

本文链接：https://blog.csdn.net/taoqick/article/details/105175514

版权

算法同时被 2 个专栏收录

474 篇文章 7 订阅

订阅专栏

智力题

14 篇文章 0 订阅

订阅专栏

Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.

Example 1:

Input:nums = [1,1,1], k = 2
Output: 2

Note:

The length of the array is in range [1, 20,000].
The range of numbers in the array is [-1000, 1000] and the range of the integer k is [-1e7, 1e7].

--------------------------------------------------------------------------------

反应有些慢啊。。。

注意命名，如果输入参数有k这种，用dict的时候就小心了，否则容易出问题。。。

另外注意dict.get(k,default_value)的写法

class Solution:
    def subarraySum(self, nums, k) -> int:
        i, res, cursum, l = 0, 0, 0, len(nums)
        if (l <= 0):
            return 0
        history = {0:1}
        for i in range(l):
            cursum += nums[i]
            prevk = cursum-k

            prevk = history.get(prevk,0)
            res += prevk

            history[cursum] = history.get(cursum, 0)+1
        return res
s = Solution()
print(s.subarraySum([1,1,1],2))