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
.
一开始没思路,想的复杂了。用两个数来记录最小和次最小的数,如果遇到比这两个数大的数,则返回true
public class Solution {
public boolean increasingTriplet(int[] nums) {
int c1=Integer.MAX_VALUE,c2=Integer.MAX_VALUE;
for(int t:nums){
if(t<=c1){
c1=t;
}
else if(t<=c2){
c2=t;
}
else{
return true;
}
}
return false;
}
}