leetcode刷题，总结，记录，备忘334

leetcode334Increasing Triplet Subsequence

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

任何判断连续的大小关系都是错误的，因为会有连续升序分开出现的情况。所以，定义2个变量，初始值为最大整数取，遍历这个整数数组，做2次判断，是否有小于等于这2个变量的数，做相应的赋值，形成2道“关卡”，进行过滤。

class Solution {
public:
    bool increasingTriplet(vector<int>& nums) {
        if (nums.size() == 1 || nums.size() == 2 || nums.size() == 0)
        {
            return false;
        }
        
        int first = INT_MAX;
        int second = INT_MAX;
        
        for (int i = 0; i < nums.size(); ++i)
        {
            if (nums[i] <= first)
            {
                first = nums[i];
            }
            else if (nums[i] <= second)
            {
                second = nums[i];
            }
            else
            {
                return true;
            }
        }
        
        return false;
    
     
    }
};