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 a098e33 commit f28a3c6Copy full SHA for f28a3c6
C++/continuous-subarray-sum.cpp
@@ -0,0 +1,25 @@
1
+// Time: O(n)
2
+// Space: O(k)
3
+
4
+class Solution {
5
+public:
6
+ bool checkSubarraySum(vector<int>& nums, int k) {
7
+ int count = 0;
8
+ unordered_map<int, int> lookup;
9
+ lookup[0] = -1;
10
+ for (int i = 0; i < nums.size(); ++i) {
11
+ count += nums[i];
12
+ if (k != 0) {
13
+ count %= k;
14
+ }
15
+ if (lookup.count(count)) {
16
+ if (i - lookup[count] > 1) {
17
+ return true;
18
19
+ } else {
20
+ lookup[count] = i;
21
22
23
+ return false;
24
25
+};
0 commit comments