334. Increasing Triplet Subsequence

最新推荐文章于 2024-08-20 23:55:32 发布

MrOneside

最新推荐文章于 2024-08-20 23:55:32 发布

阅读量224

点赞数

分类专栏： leetcode 文章标签： java leetcode

本文链接：https://blog.csdn.net/riskys/article/details/55505579

版权

leetcode 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

问题链接：点击打开链接

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

Formally the function should:

Return true if there exists i, j, k
such that arr[i] < arr[j] < arr[k] given 0 ≤ i < j < k ≤ n-1 else return false.

Your algorithm should run in O(n) time complexity and O(1) space complexity.

Examples:
Given [1, 2, 3, 4, 5],
return true.

Given [5, 4, 3, 2, 1],
return false.

通过两个比较数来进行，如果后面存在一个数num使得其大于small和big，说明找到增长序列，返回true

public class Solution {
    public boolean increasingTriplet(int[] nums) {
        if(nums==null || nums.length<=2)
            return false;
        int small=Integer.MAX_VALUE, big=Integer.MAX_VALUE;
        for(int num : nums) {
            if(num<=small)
                small = num;
            else if(num<=big)
                big = num;
            else 
                return true;
        }
        return false;
    }
}

也可以使用最长增长子序列来实现：http://blog.csdn.net/riskys/article/details/54973011