https://leetcode-cn.com/problems/subarray-sum-equals-k/solution/he-wei-kde-zi-shu-zu-by-leetcode-solution/
方法一:
class Solution {
public int subarraySum(int[] nums, int k) {
int count = 0, pre = 0;
HashMap <Integer, Integer> mp = new