Runtime: 34 ms (Top 44.53%) | Memory: 44.1 MB (Top 26.48%)

Author: AnasImloul

scripts/algorithms/L/Largest Divisible Subset/Largest Divisible Subset.java

@@ -1,3 +1,4 @@
+// Runtime: 34 ms (Top 44.53%) | Memory: 44.1 MB (Top 26.48%)
 class Solution {
     public List<Integer> largestDivisibleSubset(int[] nums) {
         Arrays.sort(nums);
@@ -20,7 +21,7 @@ public List<Integer> largestDivisibleSubset(int[] nums) {
                 if(dp[i] > maxi){
                     maxi = dp[i];
                     lastindex = i;
-                }   
+                }
             }
         }//for ends
         ans.add(nums[lastindex]);
@@ -31,4 +32,4 @@ public List<Integer> largestDivisibleSubset(int[] nums) {
         return ans;
     }
 
-}
+}