力扣算法学习day36-2
674-最长连续递增序列
题目
代码实现
class Solution {
public int findLengthOfLCIS(int[] nums) {
int[] dp = new int[nums.length];
dp[0] = 1;
int result = 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;
}
if(result < dp[i]){
result = dp[i];
}
}
return result;
}
}
718-最长重复子数组
题目
代码实现
class Solution {
public int findLength(int[] nums1, int[] nums2) {
int[][] dp = new int[nums1.length+1][nums2.length+1];
int result = 0;
for(int i = 0;i < nums1.length;i++){
for(int j = 0;j < nums2.length;j++){
if(nums1[i] == nums2[j]){
dp[i+1][j+1] = dp[i][j] + 1;
}
if(result < dp[i+1][j+1]){
result = dp[i+1][j+1];
}
}
}
return result;
}
}