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.
class Solution {
public boolean increasingTriplet(int[] nums) {
if(nums == null || nums.length<3) return false;
int a = java.lang.Integer.MAX_VALUE;
int b = java.lang.Integer.MAX_VALUE;
for (int i=0; i<nums.length; i++) // 形式 a < b < current 遍历一遍保证
{ // i < j < k
if (nums[i]<=a){ // 比a小,已经不满足条件,重置a
a = nums[i];
}else if (nums[i]<=b){ // 比a大,若比b小,则重置
b = nums[i]; // b(new) = current,之前的b被抛弃
}else{ // 比a, b都大,则输出
return true;
}
}
return false;
}
}