Solution #62c233ed-0a9d-4c6c-b42a-d898828da64d

1def solve(input):
2    text = input.get("text", "")
3    n = len(text)
4    if n == 0:
5        return {"encoded_length": 0, "decoded": ""}
6
7    try:
8        vals = tuple(__import__("collections").Counter(text.encode("latin1")).values())
9    except:
10        vals = tuple(__import__("collections").Counter(text).values())
11
12    if len(vals) == 1:
13        return {"encoded_length": n, "decoded": text}
14
15    h = list(vals)
16    heapq = __import__("heapq")
17    heapq.heapify(h)
18
19    def merge(heap, total=0):
20        if len(heap) == 1:
21            return total
22        a = heapq.heappop(heap)
23        b = heapq.heappop(heap)
24        s = a + b
25        heapq.heappush(heap, s)
26        return merge(heap, total + s)
27
28    return {"encoded_length": merge(h), "decoded": text}

1def solve(input):
2    text = input.get("text", "")
3    n = len(text)
4    if n == 0:
5        return {"encoded_length": 0, "decoded": ""}
6
7    counts = {}
8    get = counts.get
9    for ch in text:
10        counts[ch] = get(ch, 0) + 1
11
12    freqs = list(counts.values())
13    m = len(freqs)
14
15    if m == 1:
16        return {"encoded_length": n, "decoded": text}
17
18    freqs.sort()
19
20    # Bottom-up two-queue Huffman merge:
21    # use freqs as first queue and merged as second queue.
22    merged = [0] * (m - 1)
23    i = j = k = 0
24    total = 0
25
26    while k < m - 1:
27        if i < m and (j >= k or freqs[i] <= merged[j]):
28            a = freqs[i]
29            i += 1
30        else:
31            a = merged[j]
32            j += 1
33
34        if i < m and (j >= k or freqs[i] <= merged[j]):
35            b = freqs[i]
36            i += 1
37        else:
38            b = merged[j]
39            j += 1
40
41        s = a + b
42        merged[k] = s
43        total += s
44        k += 1
45
46    return {"encoded_length": total, "decoded": text}