[LeetCode Python3]334. Increasing Triplet Subsequence + 暴力搜索 + 双指针

SincX

于 2021-02-07 15:26:20 发布

阅读量132

点赞数

分类专栏： LeetCode每日一题

本文链接：https://blog.youkuaiyun.com/xvrixingkong/article/details/113741844

版权

LeetCode每日一题专栏收录该内容

172 篇文章

订阅专栏

334. Increasing Triplet Subsequence

暴力搜索

class Solution:
    def increasingTriplet(self, nums: List[int]) -> bool:
        size = len(nums)
        if size < 3:
            return False
        for i in range(size-2):
            for j in range(i+1, size-1):
                if nums[j] > nums[i]:
                    for k in range(j+1, size):
                        if nums[k] > nums[j]:
                            return True
        return False

双指针

class Solution:
    def increasingTriplet(self, nums: List[int]) -> bool:
        size = len(nums)
        if size < 3:
            return False
        small, mid = float('inf'), float('inf')
        for num in nums:
            if num <= small:
                small = num
            elif num <= mid:
                mid = num
            else:
                return True
        return False