-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay 30
More file actions
63 lines (53 loc) · 1.76 KB
/
Day 30
File metadata and controls
63 lines (53 loc) · 1.76 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#3321.find-x-sum-of-all-k-long-subarrays-ii
class Helper:
def __init__(self, x):
self.x = x
self.result = 0
self.large = SortedList()
self.small = SortedList()
self.occ = defaultdict(int)
def insert(self, num):
if self.occ[num] > 0:
self.internal_remove((self.occ[num], num))
self.occ[num] += 1
self.internal_insert((self.occ[num], num))
def remove(self, num):
self.internal_remove((self.occ[num], num))
self.occ[num] -= 1
if self.occ[num] > 0:
self.internal_insert((self.occ[num], num))
def get(self):
return self.result
def internal_insert(self, p):
if len(self.large) < self.x or p > self.large[0]:
self.result += p[0] * p[1]
self.large.add(p)
if len(self.large) > self.x:
to_remove = self.large[0]
self.result -= to_remove[0] * to_remove[1]
self.large.remove(to_remove)
self.small.add(to_remove)
else:
self.small.add(p)
def internal_remove(self, p):
if p >= self.large[0]:
self.result -= p[0] * p[1]
self.large.remove(p)
if self.small:
to_add = self.small[-1]
self.result += to_add[0] * to_add[1]
self.small.remove(to_add)
self.large.add(to_add)
else:
self.small.remove(p)
class Solution:
def findXSum(self, nums, k, x):
helper = Helper(x)
ans = []
for i in range(len(nums)):
helper.insert(nums[i])
if i >= k:
helper.remove(nums[i - k])
if i >= k - 1:
ans.append(helper.get())
return ans