import java.util.HashMap;
public class 前缀和 {
public static int subarraySum(int[] nums, int k) {
if (nums == null || nums.length == 0) {
return 0;
}
HashMap<Integer, Integer> preSumTimesMap = new HashMap<>();
preSumTimesMap.put(0, 1);
int all = 0;
int ans = 0;
for (int i = 0; i < nums.length; i++) {
all += nums[i];
if (preSumTimesMap.containsKey(all - k)) {
ans += preSumTimesMap.get(all - k);
}
if (!preSumTimesMap.containsKey(all)) {
preSumTimesMap.put(all, 1);
} else {
preSumTimesMap.put(all, preSumTimesMap.get(all) + 1);
}
}
return ans;
}
public static void main(String[] args) {
int arr[]={1,2,3,4,5,6};
System.out.println(subarraySum(arr, 5));
}
}