problem

​​485. Max Consecutive Ones​​

solution1:

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

参考

1. ​​Leetcode_485. Max Consecutive Ones​​;

完