lintcode 1212. 最大连续1的个数

给定一个二进制数组，找出该数组中最大连续1的个数。

样例
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.
Example 2:

Input: [1]
Output: 1
注意事项
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:
    /**
     * @param nums: a binary array
     * @return:  the maximum number of consecutive 1s
     */
    int findMaxConsecutiveOnes(vector<int> &nums) {
        // Write your code here
        int res=0;
        int cnt=0;
        for (auto i : nums) {
            /* code */
            if(i==1) cnt++;
            else
            {
                res=res>cnt?res:cnt;
                cnt=0;
            }
        }
        res=res>cnt?res:cnt;
        return res;
    }
};