Subarray Sum Equals K
Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.
A subarray is a contiguous non-empty sequence of elements within an array.
Example 1
Input
nums = [1,1,1], k = 2Output
2The subarrays [1, 1] at indices 0 to 1 and 1 to 2 both sum to 2.
Example 2
Input
nums = [1,2,3], k = 3Output
2The subarrays [1, 2] and [3] both sum to 3.
Constraints
- 1 <= nums.length <= 2 * 10^4
- -1000 <= nums[i] <= 1000
- -10^7 <= k <= 10^7