class Solution {
public:
bool increasingTriplet(vector<int>& nums) {
vector<int> dp;
for(int t: nums){
int l=0,r=dp.size();
while(l<r){
int mid = l+(r-l)/2;
if(t>dp[mid]) l=mid+1;
else r=mid;
}
if(r==dp.size()) dp.push_back(t);
else dp[r]=t;
if(dp.size()==3) return true;
}
return false;
}
};
LeetCode - Increasing Triplet Subsequence
猜你喜欢
转载自blog.csdn.net/real_lisa/article/details/83926868
今日推荐
周排行