mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-10 00:09:06 +01:00
cpp: add «525. Contiguous Array»
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
parent
15bd5cb743
commit
c228a24b1a
1 changed files with 27 additions and 0 deletions
27
cpp/contiguous-array.cpp
Normal file
27
cpp/contiguous-array.cpp
Normal file
|
@ -0,0 +1,27 @@
|
||||||
|
#include <unordered_map>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
class Solution {
|
||||||
|
public:
|
||||||
|
int findMaxLength(const std::vector<int> &nums) {
|
||||||
|
std::unordered_map<int, int> lengths;
|
||||||
|
lengths[0] = -1;
|
||||||
|
|
||||||
|
int max_length = 0;
|
||||||
|
int count = 0;
|
||||||
|
|
||||||
|
for (auto i = 0u; i < nums.size(); ++i) {
|
||||||
|
count += nums[i] == 1 ? 1 : -1;
|
||||||
|
|
||||||
|
auto len = lengths.find(count);
|
||||||
|
if (len != lengths.end()) {
|
||||||
|
max_length =
|
||||||
|
std::max(max_length, static_cast<int>(i) - len->second);
|
||||||
|
} else {
|
||||||
|
lengths[count] = i;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return max_length;
|
||||||
|
}
|
||||||
|
};
|
Loading…
Reference in a new issue