package question;

/**
 * @author Roderland
 * @since 1.0
 */
public class Question485 {
 public int findMaxConsecutiveOnes(int[] nums) {
 int start = 0;
 int len = 0;
 int max=0;
 while (start+len<nums.length) {
 if (nums[start+len]==1) len++;
 else {
 max=Math.max(max, len);
 start = start+len+1;
 len=0;
 }
 }
 max=Math.max(max, len);
 return max;
 }
}