class Solution {
public int findLengthOfLCIS(int[] nums) {
int length = 1;
int max = 1;
for(int i = 1; i < nums.length;i++){
if(nums[i] > nums[i - 1]){
length++;
}else{
max = Math.max(length,max);
length = 1;
}
}
return Math.max(length,max);
}
}
先来段最简单的
class Solution {
public int findLengthOfLCIS(int[] nums) {
int[] dp = new int[nums.length];
dp[0] = 1;
int max = 1;
for(int i = 1; i < nums.length;i++){
if(nums[i] > nums[i - 1]){
dp[i] = dp[i - 1] + 1;
}else {
dp[i] = 1;
}
max = Math.max(dp[i],max);
}
return max;
}
}
动态规划也差不多意思