1.题目
2.解法
①一维数组+动态规划
class Solution {
public int lengthOfLIS(int[] nums) {
int n = nums.length;
if(n == 0) return 0;
int[] dp = new int[n];
dp[0] = 1;
int res = 1;
for(int i = 1; i < n; i++){
dp[i] = 1;
for(int j = i - 1; j >= 0; j--){
if(nums[j] < nums[i]) dp[i] = Math.max(dp[i], dp[j] + 1);
}
res = Math.max(res, dp[i]);
}
return res;
}
}