leetcode:485. 最大连续1的个数

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