674. 最长连续递增序列
public static int findLengthOfLCIS(int[] nums) { int[] dp = new int[nums.length]; dp[0] = 1; for (int i = 1; i < nums.length; i++) { dfs(nums, dp, i); } Arrays.sort(dp); return dp[dp.length - 1]; } public static void dfs(int[] nums, int[] dp, int i) { if (nums[i] > nums[i - 1]) { dp[i] = dp[i - 1] + 1; } else { dp[i] = 1; } }