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:

1. The input array will only contain 0 and 1.
2. The length of input array is a positive integer and will not exceed 10,000

Tips:

别忘了最后也要比较一次local_max和res。

Code：

public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        if (nums == null || nums.length == 0) return 0;
        int res = 0, temp = 0;
        for (int i : nums) {
            if (i == 1) {
                temp++;
                continue;
            } else {
                res = Math.max(res, temp);
                temp = 0;
            }
        }
        res = Math.max(res, temp);
        return res;
    }
}