longest-contiguous-1s.py

def longestOnes(self, nums: List[int], k: int) -> int:
        maxlen = 0
        en=0
        for i in range(len(nums)):
            
            locallen=0
            while(nums[i] != 0):                  
                locallen += 1
                if locallen > maxlen:
                    maxlen = locallen
                i += 1
            if locallen > 0: en = i
        
            print(maxlen,en-maxlen-1,en) #
        
        return maxlen, en  #returns the maxumum len of the longest number of consecutive 1s in O(N) and en is the index i at the end of the longest consecutive 1s
        #start index can be calculated using en-maxlen-1