560. 和为K的子数组

题目：

感觉题目越短，越不容易，我去

解答：

class Solution:
    def subarraySum(self, nums, k):
        """效果最好的版本"""
        _dict, cur, count = {0: 1}, 0, 0
        for v in nums:
            cur += v
            count += _dict.get(cur - k, 0)
            _dict[cur] = _dict.get(cur, 0) + 1
        return count

A = Solution()
rel = A.subarraySum([1, 2, 3], 3)
print(rel)