g0501_0600.s0560_subarray_sum_equals_k.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0501_0600.s0560_subarray_sum_equals_k;
// #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array
// #2022_08_03_Time_21_ms_(98.97%)_Space_46.8_MB_(88.27%)
import java.util.HashMap;
import java.util.Map;
public class Solution {
public int subarraySum(int[] nums, int k) {
int tempSum = 0;
int ret = 0;
Map sumCount = new HashMap<>();
sumCount.put(0, 1);
for (int i : nums) {
tempSum += i;
if (sumCount.containsKey(tempSum - k)) {
ret += sumCount.get(tempSum - k);
}
if (sumCount.get(tempSum) != null) {
sumCount.put(tempSum, sumCount.get(tempSum) + 1);
} else {
sumCount.put(tempSum, 1);
}
}
return ret;
}
}