class Solution {
public int lengthOfLIS(int[] nums) {
int len = nums.length;
int[] dp = new int[len];
int res = 1;
Arrays.fill(dp, 1);
for(int i = 1 ; i < len; i++){
for(int j = 0; j < i; j++){
if(nums[i] > nums[j]){
dp[i] = Math.max(dp[i], dp[j] + 1);
}
res=Math.max(res,dp[i]);
}
}
return res;
}
}
class Solution {
public int findLengthOfLCIS(int[] nums) {
int len = nums.length;
int[] dp = new int[len];
int res = 1;
Arrays.fill(dp, 1);
for(int i = 1 ; i < len; i++){
if(nums[i] > nums[i-1]){
dp[i] = dp[i-1] +1;
}
res = Math.max(res,dp[i]);
}
return res;
}
}