Solution #82a9952b-c601-47fc-b378-f5f7e8926c9c

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        b = text.encode("latin1")
9        counts = [0] * 256
10        for x in b:
11            counts[x] += 1
12        freqs = []
13        for c in counts:
14            if c:
15                freqs.append(c)
16    except:
17        d = {}
18        for ch in text:
19            d[ch] = d.get(ch, 0) + 1
20        freqs = list(d.values())
21
22    m = len(freqs)
23    if m == 1:
24        return {"encoded_length": n, "decoded": text}
25
26    freqs.sort()
27
28    i = 0
29    j = 0
30    q = [0] * (m - 1)
31    qlen = 0
32    total = 0
33
34    while (m - i) + (qlen - j) > 1:
35        if i < m and (j >= qlen or freqs[i] <= q[j]):
36            a = freqs[i]
37            i += 1
38        else:
39            a = q[j]
40            j += 1
41
42        if i < m and (j >= qlen or freqs[i] <= q[j]):
43            b2 = freqs[i]
44            i += 1
45        else:
46            b2 = q[j]
47            j += 1
48
49        s = a + b2
50        total += s
51        q[qlen] = s
52        qlen += 1
53
54    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}