1 题目
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.
Note: Your algorithm should run in O(n) time complexity and O(1) space complexity.
Example 1:
Input: [1,2,3,4,5]
Output: true
Example 2:
Input: [5,4,3,2,1]
Output: false
2 标准解
2.1 分析
用一个Small记录目前为止最小的数,用一个Big记录目前为止第二小的数,如果存在第三个数,比Small和Big都大,则存在。
2.2 代码
class Solution {
public:
bool increasingTriplet(vector<int>& nums) {
int c1 = INT_MAX, c2 = INT_MAX;
for (int i : nums)
if (i <= c1)
c1 = i;
else if (i <= c2)
c2 = i;
else
return true;
return false;
}
};