LeetCode 485 --- Max Consecutive Ones

题目链接：
LeetCode 485 — Max Consecutive Ones

AC代码：

public class Problem485 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] name={1,1,0,1,1,1};
        System.out.println(findMaxConsecutiveOnes(name));
    }
     public static int findMaxConsecutiveOnes(int[] nums) {
         int l=0;
         int max=0;
         for(int i=0;i<nums.length;i++){
             if(nums[i]==1){
                 l++;
                 if(l>max)
                     max=l;
             }
             else{
                 l=0;
                 continue;
             }
         }


        return max;

    }

}