Runtime: 10 ms (Top 93.01%) | Memory: 44.8 MB (Top 13.42%)

AnasImloul · AnasImloul · commit 5526a9ecc9b2 · 2022-08-31T23:07:54.000+01:00
diff --git a/scripts/algorithms/B/Beautiful Arrangement/Beautiful Arrangement.java b/scripts/algorithms/B/Beautiful Arrangement/Beautiful Arrangement.java
@@ -1,3 +1,4 @@
+// Runtime: 10 ms (Top 93.01%) | Memory: 44.8 MB (Top 13.42%)
 class Solution {
     int N;
     Integer[][] memo;
@@ -6,7 +7,7 @@ public int countArrangement(int n) {
         memo = new Integer[n+1][1<<N];
         return permute(1, 0);
     }
-    
+
     private int permute(int index, int mask)
     {
         if (mask == (1<<N)-1)
@@ -25,4 +26,4 @@ private int permute(int index, int mask)
         }
         return memo[index][mask]=res;
     }
-}
+}

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+// Runtime: 10 ms (Top 93.01%) \| Memory: 44.8 MB (Top 13.42%)`
`1`	`2`	`class Solution {`
`2`	`3`	`int N;`
`3`	`4`	`Integer[][] memo;`
`@@ -6,7 +7,7 @@ public int countArrangement(int n) {`
`6`	`7`	`memo = new Integer[n+1][1<<N];`
`7`	`8`	`return permute(1, 0);`
`8`	`9`	`}`
`9`		`-`
	`10`	`+`
`10`	`11`	`private int permute(int index, int mask)`
`11`	`12`	`{`
`12`	`13`	`if (mask == (1<<N)-1)`
`@@ -25,4 +26,4 @@ private int permute(int index, int mask)`
`25`	`26`	`}`
`26`	`27`	`return memo[index][mask]=res;`
`27`	`28`	`}`
`28`		`-}`
	`29`	`+}`