Solution #21d15e87-6c59-4118-a89e-e523c6e1802f

1def solve(input):
2    text = input.get("text", "")
3    n = len(text)
4    if not n:
5        return {"encoded_length": 0, "decoded": ""}
6
7    try:
8        counts = [0] * 256
9        for ch in text:
10            counts[ord(ch)] += 1
11
12        freqs = ()
13        for c in counts:
14            if c:
15                freqs += (c,)
16    except:
17        d = {}
18        for ch in text:
19            d[ch] = d.get(ch, 0) + 1
20        freqs = ()
21        for c in d.values():
22            freqs += (c,)
23
24    m = len(freqs)
25    if m == 1:
26        return {"encoded_length": n, "decoded": text}
27
28    freqs = sorted(freqs)
29    q = [0] * (m - 1)
30    i = j = qn = total = 0
31
32    for _ in text[:0].join(" " * (m - 1)):
33        if i < m and (j >= qn or freqs[i] <= q[j]):
34            a = freqs[i]
35            i += 1
36        else:
37            a = q[j]
38            j += 1
39
40        if i < m and (j >= qn or freqs[i] <= q[j]):
41            b = freqs[i]
42            i += 1
43        else:
44            b = q[j]
45            j += 1
46
47        s = a + b
48        total += s
49        q[qn] = s
50        qn += 1
51
52    return {"encoded_length": total, "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}