update code 2

MayankUjawane · web-flow · commit a08745f16ab7 · 2022-05-26T11:49:18.000+05:30
diff --git a/Dynamic Programming/37) Longest Increasing Subsequence (Binary Search).md b/Dynamic Programming/37) Longest Increasing Subsequence (Binary Search).md
@@ -51,10 +51,10 @@ class Solution {
             int index;
             if(curr>arr[maxLength-1]) {
                 index = maxLength;
+                maxLength++;
             } else {
                 index = binarySearch(arr, 0, maxLength, curr);
             }
-            if(index==maxLength) maxLength++;
             arr[index] = curr;
         }
         return maxLength;

Original file line number	Diff line number	Diff line change
`@@ -51,10 +51,10 @@ class Solution {`
`51`	`51`	`int index;`
`52`	`52`	`if(curr>arr[maxLength-1]) {`
`53`	`53`	`index = maxLength;`
	`54`	`+ maxLength++;`
`54`	`55`	`} else {`
`55`	`56`	`index = binarySearch(arr, 0, maxLength, curr);`
`56`	`57`	`}`
`57`		`- if(index==maxLength) maxLength++;`
`58`	`58`	`arr[index] = curr;`
`59`	`59`	`}`
`60`	`60`	`return maxLength;`