Increasing Triplet Subsequence LeetCode solution in Python

1
class Solution:
2
def increasingTriplet(self, nums: List[int]) -> bool:
3
first = second = float("inf")
4
for n in nums:
5
if n <= first:
6
first = n
7
elif n <= second:
8
second = n
9
else:
10
return True
11
return False

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0