-
Notifications
You must be signed in to change notification settings - Fork 0
/
Longest Happy String
40 lines (34 loc) · 1.11 KB
/
Longest Happy String
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
from heapq import heappush, heappop
class Solution(object):
def longestDiverseString(self, a, b, c):
"""
:type a: int
:type b: int
:type c: int
:rtype: str
"""
max_heap = []
if a!=0:
heappush(max_heap, (-a, 'a'))
if b!=0:
heappush(max_heap, (-b, 'b'))
if c!=0:
heappush(max_heap, (-c, 'c'))
s = []
while max_heap:
first, char1 = heappop(max_heap)
if len(s)>=2 and (s[-1]==s[-2]==char1):
if not max_heap:
return ''.join(s)
second, char2 = heappop(max_heap)
s.append(char2)
second += 1
if second!=0:
heappush(max_heap, (second, char2))
heappush(max_heap, (first, char1))
continue
s.append(char1)
first += 1
if first!=0:
heappush(max_heap, (first, char1))
return ''.join(s)