leetcode/algorithms/max_consecutive_ones.cpp at master · hanfezh/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
// 485. Max Consecutive Ones
// Refer: https://leetcode.com/problems/max-consecutive-ones
// Author: xianfeng.zhu@gmail.com

#include <algorithm>
#include <utility>
#include <vector>

#include "gtest/gtest.h"

class Solution {
 public:
  int findMaxConsecutiveOnes(std::vector<int>& nums) {
    int prev = -1;
    int max_ones = 0;
    for (int i = 0; i < nums.size(); i++) {
      if (nums[i] == 1) {
        if (prev == -1) {
          prev = i;
        }
        max_ones = std::max(max_ones, i - prev + 1);
      } else {
        prev = -1;
      }
    }
    return max_ones;
  }
};

TEST(Solution, findMaxConsecutiveOnes) {
  std::vector<std::pair<std::vector<int>, int>> cases = {
      {{1, 1, 0, 1, 1, 1}, 3},
      {{1, 0, 1, 1, 0, 1}, 2},
  };
  for (auto& [nums, max_ones] : cases) {
    EXPECT_EQ(Solution().findMaxConsecutiveOnes(nums), max_ones);
  }
}