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

---

我的解法：O(n)

定义变量cons = temp = 0;遍历一次数组，只要不要到0，temp++；遇到0，如果temp>cons；就赋值temp给cons

---

public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int cons = 0;
        int temp = 0;
        for(int i = 0;i < nums.length; i++) {
            if(nums[i] == 1) {
                temp++;
                cons = cons>temp?cons:temp;
            } else {
                temp = 0;
            }
        }
        return cons;
    }
}