LeetCode485. 最大连续1的个数

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