题目描述:
Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.
Example 1:
Input: [0,1] Output: 2 Explanation: [0, 1] is the longest contiguous subarray with equal number of 0 and 1.
Example 2:
Input: [0,1,0] Output: 2 Explanation: [0, 1] (or [1, 0]) is a longest contiguous subarray with equal number of 0 and 1.
Note: The length of the given binary array will not exceed 50,000.
思路:借鉴别人的解法。 先把0换成1,那么就转换成使得累加和为0的最长子数组。 遍历数组,计算累加和,如果该结果第一次出现,那么用map记录下该累加和第一次出现的位置;否则就可以通过当前下标 j 减去该累加值第一次出现的位置 i,得到满足条件子数组长度,因为从i到j之间的元素累加和就是为0的。
程序:
class Solution {
public:
int findMaxLength(vector<int>& nums) {
int ans = 0;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] == 0) {
nums[i] = -1;
}
}
map<int, int> mp;
mp[0] = -1;
int sum = 0;
for (int i = 0; i < nums.size(); i++) {
sum += nums[i];
if (mp.find(sum) != mp.end()) {
ans = max(ans, i - mp[sum]);
} else {
mp[sum] = i;
}
}
return ans;
}
};