【c++】leetcode300 最长递增子序列

1.题目

2.解答

class Solution {
public:int lengthOfLIS(vector<int>& nums) {if (nums.size() <= 1) return nums.size();std::vector<int> dp(nums.size(), 1);for (auto i = 0; i < nums.size(); i++){for (auto j = 0; j < i; j++){if (nums[i] > nums[j]){dp[i] = max(dp[i], dp[j] + 1);}}}return *std::max_element(dp.begin(), dp.end());}
};