# LeetCode:Increasing Triplet Subsequence

2631人阅读 评论(0)

### 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

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;
}
}

1
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：378493次
• 积分：6670
• 等级：
• 排名：第4149名
• 原创：318篇
• 转载：1篇
• 译文：0篇
• 评论：33条
博客专栏
 Android与FFmpeg 文章：4篇 阅读：377
 LeetCode解题记录 文章：215篇 阅读：270987
 Java源码解析 文章：12篇 阅读：12248
阅读排行
评论排行
最新评论
个人收藏
友情链接