diff --git a/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java b/src/main/java/leetcode/medium/LongestIncreasingSubsequence.java
index 7a315f1..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
@@ -21,6 +21,6 @@ int lengthOfLIS(int[] nums) {
       if (T[i] > T[maxIndex])
         maxIndex = i;
 
-    return T[maxIndex] + 1;
+    return T[maxIndex];
   }
 }