485. Max Consecutive Ones

485. 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.




class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int[] dp = new int[nums.length];
        for(int i = 0; i < nums.length; i++){
            if(i == 0){
                dp[i] = nums[i];
            }else if (nums[i] == 1){
                dp[i] = dp[i - 1] + 1;
            }else {
                // else , nums[i] == 0
                dp[i] = 0;
            }
        }
        int max = 0;
        
        for(int num : dp){
            max = Math.max(max, num);
        }
        return max;
        
    }
}

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