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.
解题思路1:暴力法是对每一个可能出现的情况求结果,当1,0数量不同时,每次遍历的计数只会相同一次。
class Solution {
public:
int findMaxLength(vector<int>& nums);
};
int
Solution::findMaxLength(vector<int>& nums) {
int max_len = 0;
for (int i = 0; i < nums.size(); i++) {
int czero = 0, cone = 0;
for (int j = 0; j < nums.size(); j++) {
if (nums[j] == 0) czero++;
else cone++;
if (czero == cone) max_len = max(max_len, j - i + 1)
}
}
return max_len;
}
解题思路2:使用额外的数组建立关于0,1之间数量积与每一位索引的关系,这个额外的数组要考虑全为0或全为1的情况,所以数组的大小为2*nums.size() + 1,以nums.size()为0索引起始点。时间复杂度为O(n),空间复杂度为O(n), n = 2 * nums.size() + 1。
int
Solution::findMaxLength(vector<int>& nums) {
vector<int> relation_map(2 * nums.size() + 1, -2)
int max_len = 0;
int count = 0;
for (int i = 0; i < nums.size(); i++) {
count += nums[i] == 0 ? -1 : 1;
if (relation_map[count + nums.size()] >= -1)
max_len = max(max_len, i - relation_map[count + nums.size()] + 1);
else
relation_map[count + nums.size()] = i;
}
return max_len;
}
解题思路3:使用哈希表建立关于0,1之间数量积与每一位索引的关系。时间复杂度为O(n),空间复杂度为O(n),n取决于连续的0或1的长度,例如:
0, 0, 0, 0, 0, 0,这个map的空间大小为6
0, 1, 0, 0, 1, 1,这个map的空间大小为3
int
Solution::findMaxLength(vector<int>& nums) {
map<int, int> tmap = { {0, -1} }
int max_len = 0;
int count = 0;
for (int i = 0; i < nums.size(); i++) {
count += nums[i] == 0 ? -1 : 1;
if (tmap.find(count) != tmap.end())
max_len = max(max_len, i - tmap[count]);
else
tmap[count] = i;
}
return max_len;
}