From 70864f9e84443f6cc27321b44507a6d8b29aa04d Mon Sep 17 00:00:00 2001 From: TUJALASAIKIRAN8 <77339816+TUJALASAIKIRAN8@users.noreply.github.com> Date: Mon, 7 Oct 2024 22:38:13 +0530 Subject: [PATCH 1/2] Update LongestIncreasingSubsequence.java No need of adding 1. --- src/main/java/leetcode/medium/LongestIncreasingSubsequence.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java b/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java index 7a315f1..ab7383a 100644 --- a/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java +++ b/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java @@ -21,6 +21,6 @@ int lengthOfLIS(int[] nums) { if (T[i] > T[maxIndex]) maxIndex = i; - return T[maxIndex] + 1; + return T[maxIndex]; } } From 74d0bd256e55a672f8fec1c62112db6d2f1b695d Mon Sep 17 00:00:00 2001 From: Nikhil Lohia Date: Mon, 20 Jan 2025 13:13:29 -0800 Subject: [PATCH 2/2] no-op change to trigger workflow --- src/main/java/leetcode/medium/LongestIncreasingSubsequence.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java b/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java index ab7383a..3c0bbd5 100644 --- a/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java +++ b/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java @@ -6,7 +6,7 @@ int lengthOfLIS(int[] nums) { int[] T = new int[nums.length]; - // Start main pointer + // Start the main pointer for (int i = 1; i < nums.length; i++) // Start second pointer