Runtime: 150 ms (Top 5.98%) | Memory: 74.5 MB (Top 5.03%)

AnasImloul · AnasImloul · commit bd1ac212d4c9 · 2022-08-31T23:07:57.000+01:00
diff --git a/scripts/algorithms/W/Wiggle Subsequence/Wiggle Subsequence.java b/scripts/algorithms/W/Wiggle Subsequence/Wiggle Subsequence.java
@@ -1,3 +1,4 @@
+// Runtime: 150 ms (Top 5.98%) | Memory: 74.5 MB (Top 5.03%)
 class Solution {
     int n;
     int dp[][][];
@@ -31,11 +32,11 @@ int f(int i , int posPre , int a[] , int prev){
         }
         else{
             int not = f(i + 1 , 1 , a , prev);
-            int take = 0; 
+            int take = 0;
             if(a[i] - prev < 0){
                 take = f(i + 1 , 0 , a , a[i]) + 1;
             }
             return dp[i][prev + 1][posPre] = Math.max(not , take);
         }
     }
-}
+}

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+// Runtime: 150 ms (Top 5.98%) \| Memory: 74.5 MB (Top 5.03%)`
`1`	`2`	`class Solution {`
`2`	`3`	`int n;`
`3`	`4`	`int dp[][][];`
`@@ -31,11 +32,11 @@ int f(int i , int posPre , int a[] , int prev){`
`31`	`32`	`}`
`32`	`33`	`else{`
`33`	`34`	`int not = f(i + 1 , 1 , a , prev);`
`34`		`- int take = 0;`
	`35`	`+ int take = 0;`
`35`	`36`	`if(a[i] - prev < 0){`
`36`	`37`	`take = f(i + 1 , 0 , a , a[i]) + 1;`
`37`	`38`	`}`
`38`	`39`	`return dp[i][prev + 1][posPre] = Math.max(not , take);`
`39`	`40`	`}`
`40`	`41`	`}`
`41`		`-}`
	`42`	`+}`