Java solution


  • 0
    U
    public class Solution {
        public int findMaxConsecutiveOnes(int[] nums) {
            
            int max = 0;
            int count = 0;
            
            for (int num : nums) {
                if (num == 1) {
                    count++;
                    max = Math.max(max, count);
                } else {
                    count = 0;
                }
            }
            return max;
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.