출처: https://astrocosmos.tistory.com/202 [ASTROCOSMOS] [LeetCode] #1 Increasing Triplet Subsequence
본문 바로가기
Algorithm

[LeetCode] #1 Increasing Triplet Subsequence

by 헤지월드 2021. 7. 31.

 

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

 

댓글