Max Consecutive Ones LeetCode solution in C++

1
class Solution {
2
 public:
3
  int findMaxConsecutiveOnes(vector<int> &nums) {
4
    int curr_count = 0;
5
    int max_count = 0;
6
    int i = 0;
7
    while (i < nums.size()) {
8
      if (nums[i] == 1) {
9
        curr_count += 1;
10
        if (max_count < curr_count) max_count = curr_count;
11
      }
12

13
      else
14
        curr_count = 0;
15
      i++;
16
    }
17
    return max_count;
18
  }
19
};