Runtime: 73 ms (Top 62.96%) | Memory: 85.2 MB (Top 70.37%)

AnasImloul · AnasImloul · commit 5c36120763f2 · 2022-09-07T18:38:49.000+01:00
diff --git a/scripts/algorithms/F/Find Array Given Subset Sums/Find Array Given Subset Sums.java b/scripts/algorithms/F/Find Array Given Subset Sums/Find Array Given Subset Sums.java
@@ -1,3 +1,4 @@
+// Runtime: 73 ms (Top 62.96%) | Memory: 85.2 MB (Top 70.37%)
 class Solution {
     public int[] recoverArray(int n, int[] sums) {
         Arrays.sort(sums);
@@ -24,4 +25,4 @@ public int[] recoverArray(int n, int[] sums) {
         }
         return res;
     }
-}
+}

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+// Runtime: 73 ms (Top 62.96%) \| Memory: 85.2 MB (Top 70.37%)`
`1`	`2`	`class Solution {`
`2`	`3`	`public int[] recoverArray(int n, int[] sums) {`
`3`	`4`	`Arrays.sort(sums);`
`@@ -24,4 +25,4 @@ public int[] recoverArray(int n, int[] sums) {`
`24`	`25`	`}`
`25`	`26`	`return res;`
`26`	`27`	`}`
`27`		`-}`
	`28`	`+}`