class Solution:
def increasingTriplet(self, nums):
first = float("inf")
second = float("inf")
for i in range(len(nums)):
if nums[i] < first:
first = nums[i]
elif first < nums[i] < second:
second = nums[i]
if nums[i] > second:
return True
return False
'Algorithm' 카테고리의 다른 글
[LeetCode] #2 Longest Substring Without Repeating Characters (0) | 2021.07.31 |
---|---|
[백준] 5585번 문제: 거스름돈 파이썬 풀이 (BOJ 5585) (0) | 2021.07.31 |
댓글