Leetcode 334. Increasing Triplet Subsequence

小白菜又菜

于 2024-04-22 13:54:31 发布

阅读量387

点赞数 7

分类专栏： Leetcode 解题报告动态规划（DP）文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/mobius_strip/article/details/138073369

版权

解题报告同时被 3 个专栏收录

1392 篇文章

订阅专栏

动态规划（DP）

218 篇文章

订阅专栏

Leetcode

168 篇文章

订阅专栏

该篇文章介绍了如何使用动态规划方法解决一个编程问题，判断给定整数数组中是否存在三个元素满足nums[i]<nums[j]<nums[k]的条件。代码展示了从数组前端开始扫描，利用最小前缀值更新dp数组的过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.

Algorithm

Dynamic Programming (DP). Following the increasing length of tuples, scan the array from front to back each time, saving the position of the smallest prefix of length L-1: if the data is larger than the smallest prefix, a new sequence of length L is found, otherwise update the prefix.

Code

class Solution:
    def increasingTriplet(self, nums: List[int]) -> bool:
        nLen = len(nums)
        dp = [1] * nLen
        for i in range(1, 3):
            min_value_index = 0
            while min_value_index < nLen and dp[min_value_index] < i:
                min_value_index += 1
            if min_value_index >= nLen:
                return False
            
            j = min_value_index+1
            while j < nLen:
                if dp[j] == i:
                    if nums[min_value_index] < nums[j]:
                        dp[j] = i+1
                    else:
                        min_value_index = j
                j += 1
        
        return max(dp) >= 3