FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/C++/continuous-subarray-sum.cpp at master · pythonpeixun/LeetCode-Solutions · GitHub
pythonpeixun
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
C++
/
continuous-subarray-sum.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
25 lines (24 loc) · 590 Bytes
Breadcrumbs
LeetCode-Solutions
/
C++
/
continuous-subarray-sum.cpp
Copy path
File metadata and controls
25 lines (24 loc) · 590 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
//
Time: O(n)
//
Space: O(k)
class
Solution
{
public:
bool
checkSubarraySum
(vector<
int
>& nums,
int
k) {
int
count =
0
;
unordered_map<
int
,
int
> lookup;
lookup[
0
] = -
1
;
for
(
int
i =
0
; i < nums.
size
(); ++i) {
count += nums[i];
if
(k !=
0
) {
count %= k;
}
if
(lookup.
count
(count)) {
if
(i - lookup[count] >
1
) {
return
true
;
}
}
else
{
lookup[count] = i;
}
}
return
false
;
}
};
Back
|
FazBrowse Home
|
New Git URL