subseq只會有三種情況
全偶
全奇
奇偶交錯
三個都囚出來就可以了
def maximumLength(self, nums: List[int]) -> int:
resi = [x%2 for x in nums]
a, b = resi.count(0), resi.count(1)
pre, c = resi[0], 1
for i in range(1, len(resi)):
if resi[i] != pre:
c += 1
pre = resi[i]
return max(a,b,c)