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