Given an integer array nums and an integer k, return the number of contiguous, non-empty subarrays whose sum equals k.
Examples
Example 1
- Input
- nums = [1, 1, 1], k = 2
- Output
- 2
Example 2
- Input
- nums = [1, 2, 3], k = 3
- Output
- 2
- Why
- [1, 2] and [3] both add up to 3.
Constraints
1 <= nums.length <= 2 * 10^4-1000 <= nums[i] <= 1000-10^7 <= k <= 10^7