485. 最大连续 1 的个数
class Solution { public: int findMaxConsecutiveOnes(vector<int>& nums) { int count=0; int max=count; for(int i=0;i<nums.size();i++){ if(nums[i]==1) count++; if(count>max) max = count; if(nums[i]!=1) count=0; } return max; } };
class Solution { public: int findMaxConsecutiveOnes(vector<int>& nums) { int count=0; int max=count; for(int i=0;i<nums.size();i++){ if(nums[i]==1) count++; if(count>max) max = count; if(nums[i]!=1) count=0; } return max; } };