class Solution(object):
def findMaxConsecutiveOnes(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
prev = []
now = []
result = 0
for n in nums :
if n == 1 :
now.append(n)
else :
if len(prev) > len(now) :
prev = prev
else :
prev = now
now = []
result = max(len(prev), len(now))
return result
문제 풀이
현재는 space complexity가 너무 큼 -> 줄일 수 있음