We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 7039e95 commit 89a536fCopy full SHA for 89a536f
README.md
@@ -2614,4 +2614,6 @@ https://leetcode.cn/problems/count-vowel-strings-in-ranges
2614
2615
https://leetcode.cn/problems/maximum-number-of-weeks-for-which-you-can-work
2616
2617
+https://leetcode.cn/problems/subarray-sum-equals-k
2618
+
2619
</details>
subarray-sum-equals-k/index.ts
@@ -0,0 +1,18 @@
1
+function subarraySum(nums: number[], k: number) {
2
+ const mp = new Map<number, number>();
3
+ mp.set(0, 1);
4
+ let count = 0, pre = 0;
5
+ for (const x of nums) {
6
+ pre += x;
7
+ if (mp.has(pre - k)) {
8
+ count += mp.get(pre - k) ?? 0;
9
+ }
10
+ if (mp.has(pre)) {
11
+ mp.set(pre, (mp.get(pre) ?? 0) + 1);
12
+ } else {
13
+ mp.set(pre, 1);
14
15
16
+ return count;
17
+}
18
+export default subarraySum;
0 commit comments