We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 41cf136 commit 4bd7c7bCopy full SHA for 4bd7c7b
C++/contiguous-array.cpp
@@ -6,13 +6,13 @@ class Solution {
6
int findMaxLength(vector<int>& nums) {
7
int result = 0, count = 0;
8
unordered_map<int, int> lookup;
9
- lookup[0] = 0;
+ lookup[0] = -1;
10
for (int i = 0; i < nums.size(); ++i) {
11
count += nums[i] == 1 ? 1 : -1;
12
if (lookup.count(count)) {
13
- result = max(result, i + 1 - lookup[count]);
+ result = max(result, i - lookup[count]);
14
} else {
15
- lookup[count] = i + 1;
+ lookup[count] = i;
16
}
17
18
return result;
0 commit comments