文章目录
题目
代码（9.9 首刷看解析）
class Solution {
public:
int findMaxLength(vector<int>& nums) {
int maxLen = 0;
unordered_map<int, int> mp;
int counter = 0;
mp[counter] = -1;
for(int i = 0; i < nums.size(); i++) {
int num = nums[i];
if(num == 1) {
counter++;
} else {
counter--;
}
if(mp.count(counter)) {
int preIndex = mp[counter];
maxLen = max(maxLen, i - preIndex);
} else {
mp[counter] = i;
}
}
return maxLen;
}
};