今日任务
300.最长递增子序列
674. 最长连续递增序列
718. 最长重复子数组
300.最长递增子序列
题目链接:. - 力扣(LeetCode)
class Solution {
public int lengthOfLIS(int[] nums) {
int[] dp = new int[nums.length];
if (nums.length == 0) return 0;
if (nums.length == 1) return 1;
Arrays.fill(dp, 1);
dp[0] = 1;
int res = 0;
for (int i = 1; i < nums.length; 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;
}
}
674. 最长连续递增序列
题目链接: . - 力扣(LeetCode)
class Solution {
public int findLengthOfLCIS(int[] nums) {
int res = 0;
int count = 1;
if (nums.length == 1) return 1;
for (int i = 1; i < nums.length; i++) {
if (nums[i] > nums[i - 1]) {
count++;
} else {
count = 1;
}
res = Math.max(res, count);
}
return res;
}
}
718. 最长重复子数组
题目链接: . - 力扣(LeetCode)
class Solution {
public int findLength(int[] nums1, int[] nums2) {
int[][] dp = new int[nums1.length][nums2.length];
// 初始化
int res = 0;
for (int i = 0; i < nums1.length; i++) {
for (int j = 0; j < nums2.length; j++) {
if (nums1[i] == nums2[j]) dp[i][j] = 1;
if (i >= 1 && j >= 1 && nums1[i] == nums2[j]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
res = Math.max(res, dp[i][j]);
}
}
return res;
}
}