LeetCode485. 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

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

你需要遍歷一遍才知道最大連續值，如果你連這題都做不出來，你有兩條路可以走，第一是別當程序員了，第二是做程序員鼓勵師。