Fork me on GitHub

Increasing Triplet Subsequence

Posted on

Description

https://leetcode.com/problems/increasing-triplet-subsequence/

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
public:
    bool increasingTriplet(vector<int>& nums) {
        
        if (nums.size() < 3) return false;
        int lower = INT_MAX; 
        int mid = INT_MAX;
        for (int i = 0; i < nums.size(); i++) {
            int item = nums[i];
            if (item < lower) {
                lower = item;
                continue;
            }
            if (item < mid && item > lower) {
                mid = item;
                continue;
            }
            if (item > mid) return true;
        }
        
        return false;
    }
};