-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1224.py
81 lines (72 loc) · 2.81 KB
/
1224.py
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
__________________________________________________________________________________________________
sample 428 ms submission
# not my submission
class Solution:
def maxEqualFreq(self, nums: List[int]) -> int:
from collections import Counter
counter = Counter(nums)
count2ref = Counter()
for v, c in counter.items():
count2ref[c] += 1
i = len(nums) - 1
def dec_count(count):
count2ref[count] -= 1
if count2ref[count] == 0:
count2ref.pop(count)
while i > 0:
if len(count2ref.keys()) == 2:
keys2values = list(count2ref.items())
keys2values.sort()
if keys2values[1][0] - keys2values[0][0] == 1 and keys2values[1][1] == 1: return i + 1
elif keys2values[0][0] == 1 and keys2values[0][1] == 1: return i + 1
elif len(count2ref.keys()) == 1:
keys2values = list(count2ref.items())
if keys2values[0][1] > 1 and keys2values[0][0] == 1: return i + 1
elif keys2values[0][0] > 1 and keys2values[0][1] == 1: return i + 1
counter[nums[i]] -= 1
if counter[nums[i]] == 0:
counter.pop(nums[i])
dec_count(1)
else:
dec_count(counter[nums[i]] + 1)
count2ref[counter[nums[i]]] += 1
i -= 1
return 2
__________________________________________________________________________________________________
sample 452 ms submission
class Solution:
def maxEqualFreq(self, nums: List[int]) -> int:
from collections import Counter
counter = Counter(nums)
count2ref = Counter()
for v, c in counter.items():
count2ref[c] += 1
i = len(nums) - 1
def dec_count(count):
count2ref[count] -= 1
if count2ref[count] == 0:
count2ref.pop(count)
while i > 0:
if len(count2ref.keys()) == 2:
keys2values = list(count2ref.items())
keys2values.sort()
if keys2values[1][0] - keys2values[0][0] == 1 and keys2values[1][1] == 1:
return i + 1
elif keys2values[0][0] == 1 and keys2values[0][1] == 1:
return i + 1
elif len(count2ref.keys()) == 1:
keys2values = list(count2ref.items())
if keys2values[0][1] > 1 and keys2values[0][0] == 1:
return i + 1 # example: [1,2,3,4,5]
elif keys2values[0][0] > 1 and keys2values[0][1] == 1:
return i + 1 # example: [1,1,1,1,1]
counter[nums[i]] -= 1
if counter[nums[i]] == 0:
counter.pop(nums[i])
dec_count(1)
else:
dec_count(counter[nums[i]] + 1)
count2ref[counter[nums[i]]] += 1
i -= 1
return 2
__________________________________________________________________________________________________