mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-21 21:27:36 +00:00
Code Issues Packages Projects Releases Wiki Activity

enhancement (#803)

Browse Source
This commit is contained in:
Níkolas Vargas 2019-05-16 08:20:42 -03:00 committed by John Law
parent 76061ab2cc
commit c47c1ab03c
1 changed files with 6 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
compression/huffman.py
View File

@ -29,12 +29,7 @@ def parse_file(file_path):
if not c: if not c:
break break
chars[c] = chars[c] + 1 if c in chars.keys() else 1 chars[c] = chars[c] + 1 if c in chars.keys() else 1
letters = [] return sorted([Letter(c, f) for c, f in chars.items()], key=lambda l: l.freq)
for char, freq in chars.items():
letter = Letter(char, freq)
letters.append(letter)
letters.sort(key=lambda l: l.freq)
return letters
def build_tree(letters): def build_tree(letters):
""" """