Runtime: 70 ms (Top 44.94%) | Memory: 14.9 MB (Top 51.98%)

AnasImloul · AnasImloul · commit 52641b294950 · 2022-08-28T12:45:39.000+01:00
diff --git a/scripts/algorithms/J/Jump Game V/Jump Game V.cpp b/scripts/algorithms/J/Jump Game V/Jump Game V.cpp
@@ -1,3 +1,4 @@
+// Runtime: 70 ms (Top 44.94%) | Memory: 14.9 MB (Top 51.98%)
 class Solution {
     vector<int> dp;
     int countJumps(vector<int>& arr, int i, int d){
@@ -16,7 +17,7 @@ class Solution {
         k = 1;
         while(k <= d && i - k >= 0){
             if(arr[i] > arr[i - k]){
-                jumps =  max(countJumps(arr, i-k, d)+1, jumps);
+                jumps = max(countJumps(arr, i-k, d)+1, jumps);
                 k++;
             }
             else{
@@ -35,4 +36,4 @@ class Solution {
         }
         return maxJumps + 1;
     }
-};
+};

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+// Runtime: 70 ms (Top 44.94%) \| Memory: 14.9 MB (Top 51.98%)`
`1`	`2`	`class Solution {`
`2`	`3`	`vector<int> dp;`
`3`	`4`	`int countJumps(vector<int>& arr, int i, int d){`
`@@ -16,7 +17,7 @@ class Solution {`
`16`	`17`	`k = 1;`
`17`	`18`	`while(k <= d && i - k >= 0){`
`18`	`19`	`if(arr[i] > arr[i - k]){`
`19`		`- jumps = max(countJumps(arr, i-k, d)+1, jumps);`
	`20`	`+ jumps = max(countJumps(arr, i-k, d)+1, jumps);`
`20`	`21`	`k++;`
`21`	`22`	`}`
`22`	`23`	`else{`
`@@ -35,4 +36,4 @@ class Solution {`
`35`	`36`	`}`
`36`	`37`	`return maxJumps + 1;`
`37`	`38`	`}`
`38`		`-};`
	`39`	`+};`