algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-24 04:54:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
src/main/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequence.java
View File

@ -8,7 +8,6 @@ import java.util.Scanner;
public class LongestIncreasingSubsequence {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
@ -48,7 +47,6 @@ public class LongestIncreasingSubsequence {
tail[0] = array[0];
for (int i = 1; i < N; i++) {
// new smallest value
if (array[i] < tail[0]) {
tail[0] = array[i];
@ -86,6 +84,7 @@ public class LongestIncreasingSubsequence {
}
return lis;
}
// O(logn)
private static int binarySearchBetween(int[] t, int end, int key) {