Time: 53 ms (36.58%), Space: 67.9 MB (5.17%) - LeetHub

py3-coder · py3-coder · commit 2a36c3c2dc64 · 2024-12-08T15:12:05.000+05:30
diff --git a/1235-maximum-profit-in-job-scheduling/1235-maximum-profit-in-job-scheduling.java b/1235-maximum-profit-in-job-scheduling/1235-maximum-profit-in-job-scheduling.java
@@ -13,24 +13,7 @@ public int jobScheduling(int[] startTime, int[] endTime, int[] profit) {
         map =new HashMap<>();
         return solveMemoOptimised(0,triple,n);
     }
-    public static int solveMemoOptimised(int indx,List<Triple> tp,int n){
-        //Base Case::
-        if(indx == n) return 0;
-        if(map.containsKey(indx)){
-            return map.get(indx);
-        }
-        // Choices we have ::: pick or not pick
-        
-        int next =getNextIndx(tp,indx,n);
-        int pick =tp.get(indx).profit+solveMemoOptimised(next,tp,n);
-        
-        int notPick =solveMemoOptimised(indx+1,tp,n);
-        map.put(indx,Math.max(pick,notPick));
-        return Math.max(pick,notPick);
-        
-    }
-    // Previous Approch : getting tle ::
-     // public static int solveMemo(int indx,int lasttime,List<Triple> tp){
+    // public static int solveMemo(int indx,int lasttime,List<Triple> tp){
     //     //Base Case::
     //     if(indx == tp.size()) return 0;
     //     // Choices we have ::: pick or not pick
@@ -47,6 +30,22 @@ public static int solveMemoOptimised(int indx,List<Triple> tp,int n){
     //     map.put(key,Math.max(pick,notPick));
     //     return Math.max(pick,notPick);
     // }
+    public static int solveMemoOptimised(int indx,List<Triple> tp,int n){
+        //Base Case::
+        if(indx == n) return 0;
+        if(map.containsKey(indx)){
+            return map.get(indx);
+        }
+        // Choices we have ::: pick or not pick
+        
+        int next =getNextIndx(tp,indx,n);
+        int pick =tp.get(indx).profit+solveMemoOptimised(next,tp,n);
+        
+        int notPick =solveMemoOptimised(indx+1,tp,n);
+        map.put(indx,Math.max(pick,notPick));
+        return Math.max(pick,notPick);
+        
+    }
     public static int getNextIndx(List<Triple> tp,int indx,int n){
         int l=indx+1;
         int h=n-1;
