Commit 966879e

authored

Create 1982.py

1 parent 99daa3c commit 966879eCopy full SHA for 966879e

File tree

+25

-0

lines changed

+25

-0

lines changed

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,25 @@`
	`1`	`+class Solution:`
	`2`	`+ def recoverArray(self, n, sums):`
	`3`	`+ def dfs(n, sums):`
	`4`	`+ if n == 1 and 0 in sums: return [max(sums, key = abs)]`
	`5`	`+ cands = []`
	`6`	`+`
	`7`	`+ d = sums[1] - sums[0]`
	`8`	`+`
	`9`	`+ for dr in [1, -1]:`
	`10`	`+ cnt, new = Counter(sums), []`
	`11`	`+ if cnt[0] == 0: return []`
	`12`	`+ for num in sums[::-dr]:`
	`13`	`+ if cnt[num] == 0: continue`
	`14`	`+ if cnt[num - d*dr] == 0: break`
	`15`	`+ cnt[num] -= 1`
	`16`	`+ new += [num]`
	`17`	`+ cnt[num - d*dr] -= 1`
	`18`	`+`
	`19`	`+ if len(new) == 1 << (n-1):`
	`20`	`+ cands += [[-d*dr] + dfs(n - 1, new[::-dr])]`
	`21`	`+`
	`22`	`+ return max(cands, key = len)`
	`23`	`+`
	`24`	`+ sums = sorted(sums)`
	`25`	`+ return dfs(n, sums)`

Comments

(0)