class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
if(0 == nums.size())
return 0;
int maxVal = 1;
vector<int> dpVal(nums.size(), 0x80000000);
dpVal[0] = 1;
for(int i = 1; i < dpVal.size(); ++i){
dpVal[i] = 1;
for(int j = i-1; j >= 0; --j){
if(nums[i] > nums[j]){
dpVal[i] = max(dpVal[i], dpVal[j] + 1);
}
}
maxVal = max(maxVal, dpVal[i]);
}
return maxVal;
}
};
300. Longest Increasing Subsequence
最新推荐文章于 2024-09-11 15:54:46 发布