zoukankan      html  css  js  c++  java
  • [LeetCode] Max Consecutive Ones

    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的个数。遍历数组进行判断取最大的连续1的个数即可。

    class Solution {
    public:
        int findMaxConsecutiveOnes(vector<int>& nums) {
            int res = 0, cnt = 0;
            for (int i = 0; i != nums.size(); i++) {
                if (nums[i] == 1) 
                    cnt++;
                else
                    cnt = 0;
                res = max(res, cnt);
            }
            return res;
        }
    };
    // 36 ms
  • 相关阅读:
    各种 SDk
    面试第一周
    KVC/KVO 的概述和使用
    How Many Tables HDU
    The Suspects POJ
    Wireless Network POJ
    Layout POJ
    The Shortest Path in Nya Graph HDU
    Extended Traffic LightOJ
    Tram POJ
  • 原文地址:https://www.cnblogs.com/immjc/p/7146570.html
Copyright © 2011-2022 走看看