解题思路:
(1)跳过0,判断连续的1即可
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int max=0,count=0;
int i = 0;
while(i<nums.size()) {
while(i<nums.size() && nums[i]==1) {
count++;
i++;
}
if(max<count) max = count;
count = 0;
i++;
}
return max;
}
};