485. Max Consecutive Ones

题目

485. Max Consecutive Ones

解题思路

用continus来判断数字1是否连续并记录一个连续1的长度，遇到0后与之前记录的最大长度max比较

具体代码

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