LeetCode:Increasing Triplet Subsequence

Increasing Triplet Subsequence




Total Accepted: 14818 Total Submissions: 43443 Difficulty: Medium

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.

Credits:
Special thanks to @DjangoUnchained for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Similar Problems
 (M) Longest Increasing Subsequence































java code:

public class Solution {
    public boolean increasingTriplet(int[] nums) {
        
        int max = (1<<31)-1;
        int mid = (1<<31)-1;
        
        for(int num : nums) {
            if(num <= mid)
                mid = num;
            else if(num <= max)
                max = num;
            else
                return true;
        }
        
        return false;
    }
}


阅读更多
版权声明:本文为博主原创文章,转载请注明出处。 https://blog.csdn.net/itismelzp/article/details/51554985
个人分类: LeetCode OJ
所属专栏: LeetCode解题记录
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

LeetCode:Increasing Triplet Subsequence

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭