LeetCode 485. Max Consecutive Ones(Java)

原题：
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.max变量保存当前最大连续数，每次遍历都与之进行比较；
2.count变量，记录当前连续1的个数；
3.当遇到非1元素时，对比max与count，将较大者赋给max;
4.返回max。

---

代码：

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