【从0到1冲刺蓝桥杯国赛】每日一练——最长递增子序列
最长递增子序列
https://leetcode-cn.com/problems/longest-increasing-subsequence/
题目描述：
class Solution {public: int lengthOfLIS(vector& nums) { int n = (int)nums.size(); if (n == 0) { return 0; } vector dp(n, 0); for (int i = 0; i < n; ++i) { dp[i] = 1; for (int j = 0; j < i; ++j) { if (nums[j] < nums[i]) { dp[i] = max(dp[i], dp[j] + 1); } } } return *max_element(dp.begin(), dp.end()); }};cc
