Commit 03287df

committed

Time: 888 ms (15.20%) | Memory: 52.1 MB (19.30%) - LeetSync

1 parent 260d765 commit 03287dfCopy full SHA for 03287df

File tree

+61

-0

lines changed

2267-minimum-difference-in-sums-after-removal-of-elements
- minimum-difference-in-sums-after-removal-of-elements.py

+61

-0

lines changed

Lines changed: 61 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,61 @@`
	`1`	`+class Solution:`
	`2`	`+ def minimumDifference(self, nums: List[int]) -> int:`
	`3`	`+ N = len(nums)`
	`4`	`+ n = N // 3`
	`5`	`+ min_sums = [0] * (N + 1)`
	`6`	`+ max_sums = [0] * (N + 1)`
	`7`	`+`
	`8`	`+ max_heap_l = []`
	`9`	`+ sum_l = 0`
	`10`	`+`
	`11`	`+ for i in range(N):`
	`12`	`+ heapq.heappush(max_heap_l, -nums[i])`
	`13`	`+ sum_l += nums[i]`
	`14`	`+`
	`15`	`+ if len(max_heap_l) > n:`
	`16`	`+ removed = -heapq.heappop(max_heap_l)`
	`17`	`+ sum_l -= removed`
	`18`	`+`
	`19`	`+ if len(max_heap_l) == n:`
	`20`	`+ min_sums[i + 1] = sum_l`
	`21`	`+`
	`22`	`+ min_heap_r = []`
	`23`	`+ sum_r = 0`
	`24`	`+`
	`25`	`+ for i in range(N-1, -1, -1):`
	`26`	`+ heapq.heappush(min_heap_r, nums[i])`
	`27`	`+ sum_r += nums[i]`
	`28`	`+`
	`29`	`+ if len(min_heap_r) > n:`
	`30`	`+ removed = heapq.heappop(min_heap_r)`
	`31`	`+ sum_r -= removed`
	`32`	`+`
	`33`	`+ if len(min_heap_r) == n:`
	`34`	`+ max_sums[i] = sum_r`
	`35`	`+`
	`36`	`+`
	`37`	`+`
	`38`	`+ # print(max_sums)`
	`39`	`+ # print(min_sums)`
	`40`	`+`
	`41`	`+ min_diff = float("inf")`
	`42`	`+`
	`43`	`+ for i in range(n, 2*n + 1):`
	`44`	`+`
	`45`	`+ min_diff = min(min_diff, min_sums[i] - max_sums[i])`
	`46`	`+`
	`47`	`+ return min_diff`
	`48`	`+ """`
	`49`	`+ nums = [7,9,5 ,8,1,3]`
	`50`	`+ len(nums) = 6 = 3* 2`
	`51`	`+ remove 2 elements`
	`52`	`+ divide /2`
	`53`	`+ 4`
	`54`	`+ 5,8,1,3`
	`55`	`+ left - right = minimum`
	`56`	`+ go from left to right`
	`57`	`+ remove maxim`
	`58`	`+`
	`59`	`+`
	`60`	`+`
	`61`	`+ """`

Comments

(0)