Runtime: 15 ms (Top 68.33%) | Memory: 43.7 MB (Top 85.25%)

Author: AnasImloul

scripts/algorithms/L/Longest Increasing Subsequence/Longest Increasing Subsequence.java

@@ -1,27 +1,28 @@
+// Runtime: 15 ms (Top 68.33%) | Memory: 43.7 MB (Top 85.25%)
 class Solution {
     public int lengthOfLIS(int[] nums) {
-       
+
         ArrayList<Integer> lis = new ArrayList<>();
-        
+
         for(int num:nums){
-            
+
             int size = lis.size();
-            
+
             if(size==0 ||size>0 && num>lis.get(size-1)){
                 lis.add(num);
             }else{
                 int insertIndex = bs(lis,num);
                 lis.set(insertIndex,num);
             }
         }
-        
+
         return lis.size();
     }
-    
+
     int bs(List<Integer> list, int target){
         int lo = 0;
         int hi = list.size()-1;
-        
+
         while(lo<hi){
             int mid = (lo+hi)/2;
             if(list.get(mid)<target){
@@ -32,4 +33,4 @@ int bs(List<Integer> list, int target){
         }
         return lo;
     }
-}
+}