//方法三: 动态规划
//递推公式: 若在目标数组array[]的前i个元素中,最长递增子序列的长度为LIS[i],那么:
//if array[i + 1] > array[k], for any k <= i;
//LIS[i + 1] = max(1, LIS[k] + 1);
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
int n = nums.size();
if (nums.size() < 1)
return 0;
int maxLength = 1;
int dp[n];
for (int i = 0; i < n; i++)
{
dp[i] = 1;
}
for (int i = 0; i < nums.size(); i++)
{
for (int j = 0; j < i; j++)
{
if (nums[i] > nums[j] && dp[j] + 1 > dp[i])
{
dp[i] = dp[j] + 1;
maxLength = max(maxLength, dp[i]);
}
}
}
return maxLength;
}
};