题目:
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
.
解题思路采用动态规划思想。
dp[i]为以第i个元素为结尾的递增子数组长度。那么,对于任意比i小的j,如果nums[i]>nums[j],
dp[i]=max(dp[i],dp[j]+1)
如果可以得到某个dp[i]=3,那么返回true,遍历完不存在则返回false。
代码如下:
class Solution {
public:
bool increasingTriplet(vector<int>& nums) {
int n=nums.size();
if(n<3) return false;
vector<int> dp(n,1);
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(nums[j]<nums[i]){
dp[i]=max(dp[i],dp[j]+1);
if(dp[i]==3) return true;
}
}
}
return false;
}
};