質問編集履歴
1
見やすく修正
test
CHANGED
|
File without changes
|
test
CHANGED
|
@@ -1,3 +1,5 @@
|
|
|
1
|
+
```ここに言語を入力
|
|
2
|
+
|
|
1
3
|
freq = dict()
|
|
2
4
|
|
|
3
5
|
for line in open(filename, 'rb'):
|
|
@@ -10,16 +12,18 @@
|
|
|
10
12
|
|
|
11
13
|
|
|
12
14
|
|
|
13
|
-
|
|
15
|
+
# 頻度が少ないものから順に枝をまとめてツリー形成
|
|
14
16
|
|
|
15
17
|
wtree = [i for i in freq.items()]
|
|
16
18
|
|
|
17
19
|
while len(wtree) > 1:
|
|
18
20
|
|
|
19
|
-
|
|
21
|
+
# 出現頻度ワースト2の枝を見つけてまとめる
|
|
20
22
|
|
|
21
|
-
wtree.sort(lambda a,b: cmp(b[1], a[1]))
|
|
23
|
+
wtree.sort(lambda a,b: cmp(b[1], a[1])) //ここをpython3用に変えたい
|
|
22
24
|
|
|
23
25
|
b2, b1 = (wtree.pop(), wtree.pop())
|
|
24
26
|
|
|
25
27
|
wtree.append(((b1[0], b2[0]), b1[1] + b2[1]))
|
|
28
|
+
|
|
29
|
+
```
|