LeetCode 485. Max Consecutive Ones

最新推荐文章于 2022-08-27 22:30:49 发布

薛离子

最新推荐文章于 2022-08-27 22:30:49 发布

阅读量600

点赞数

分类专栏： LeetCode LeetCode 文章标签：最大连续1的次数 Max Consecutiv Ones C++

本文链接：https://blog.csdn.net/teffi/article/details/54633909

版权

LeetCode 同时被 2 个专栏收录

98 篇文章 1 订阅

订阅专栏

LeetCode

98 篇文章 1 订阅

订阅专栏

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:

Input: [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s.
    The maximum number of consecutive 1s is 3.

Note:

The input array will only contain 0 and 1.
The length of input array is a positive integer and will not exceed 10,000

分析：
每找到1，用一个标记submax标记连续出现1的次数，然后取max和submax最大的值。

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