代码:
java
class Solution {
public int lengthOfLIS(int[] nums) {
int n = nums.length;
int[] dp = new int[n];
dp[0] = 1;
for(int i=1;i<n;i++){
int j=i-1;
dp[i] = 1;
for(;j>=0;j--){
if(nums[i]>nums[j]){
dp[i] = Math.max(dp[j]+1,dp[i]);
}
}
}
int max = 1;
for(int i=0;i<n;i++){
max = Math.max(dp[i],max);
System.out.println(dp[i]);
}
return max;
}
}