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的个数。简单题，直接计数，遇到0和1切换的时候记得更新一下结果就好了。完整代码如下： [cpp] class Solution { public: int findMaxConsecutiveOnes(vector<int>& nums) { int ans = 0, cnt = 0; for (int i = 0; i < nums.size(); ++i) { if (nums[i] == 1) { if (i == 0 || nums[i – 1] == 1)cnt++; else if (nums[i – 1] == 0) { ans = max(ans, cnt); cnt = 1; } } } return max(ans, cnt); } }; [/cpp] 本代码提交AC，用时49MS。]]>