File tree Expand file tree Collapse file tree 3 files changed +12
-12
lines changed
solution/0500-0599/0560.Subarray Sum Equals K Expand file tree Collapse file tree 3 files changed +12
-12
lines changed Original file line number Diff line number Diff line change @@ -82,12 +82,12 @@ class Solution {
82
82
function subarraySum(nums : number [], k : number ): number {
83
83
let ans = 0 ,
84
84
s = 0 ;
85
- let counter = new Map ();
86
- counter [ 0 ] = 1 ;
85
+ const counter = new Map ();
86
+ counter . set ( 0 , 1 ) ;
87
87
for (const num of nums ) {
88
88
s += num ;
89
- ans += counter [ s - k ] || 0 ;
90
- counter [ s ] = (counter [ s ] || 0 ) + 1 ;
89
+ ans += counter . get ( s - k ) || 0 ;
90
+ counter . set ( s , (counter . get ( s ) || 0 ) + 1 ) ;
91
91
}
92
92
return ans ;
93
93
}
Original file line number Diff line number Diff line change @@ -65,12 +65,12 @@ class Solution {
65
65
function subarraySum(nums : number [], k : number ): number {
66
66
let ans = 0 ,
67
67
s = 0 ;
68
- let counter = new Map ();
69
- counter [ 0 ] = 1 ;
68
+ const counter = new Map ();
69
+ counter . set ( 0 , 1 ) ;
70
70
for (const num of nums ) {
71
71
s += num ;
72
- ans += counter [ s - k ] || 0 ;
73
- counter [ s ] = (counter [ s ] || 0 ) + 1 ;
72
+ ans += counter . get ( s - k ) || 0 ;
73
+ counter . set ( s , (counter . get ( s ) || 0 ) + 1 ) ;
74
74
}
75
75
return ans ;
76
76
}
Original file line number Diff line number Diff line change 1
1
function subarraySum ( nums : number [ ] , k : number ) : number {
2
2
let ans = 0 ,
3
3
s = 0 ;
4
- let counter = new Map ( ) ;
5
- counter [ 0 ] = 1 ;
4
+ const counter = new Map ( ) ;
5
+ counter . set ( 0 , 1 ) ;
6
6
for ( const num of nums ) {
7
7
s += num ;
8
- ans += counter [ s - k ] || 0 ;
9
- counter [ s ] = ( counter [ s ] || 0 ) + 1 ;
8
+ ans += counter . get ( s - k ) || 0 ;
9
+ counter . set ( s , ( counter . get ( s ) || 0 ) + 1 ) ;
10
10
}
11
11
return ans ;
12
12
}
You can’t perform that action at this time.
0 commit comments