+/EE360C
algorithms
git clone https://git.julia.blue/+/EE360C
381a8ab
master
1import java .util .*; 2import java .util .stream .Collectors ; 3 4public class HuffmanTree { 5TreeNode root =null ; 6Map <String ,String >m ; 7 8public void constructHuffmanTree (List <String >characters , 9List <Integer >freq ) { 10PriorityQueue <TreeNode >q =new PriorityQueue <>(); 11for (int i =0 ;i <freq .size (); ++i ) { 12q .add (new TreeNode (characters .get (i ),freq .get (i ))); 13 } 14while (q .size () >1 ) { 15TreeNode a =q .poll (); 16TreeNode b =q .poll (); 17q .add (new TreeNode (a ,b )); 18 } 19root =q .poll (); 20m =root .getMap (); 21 } 22 23public String encode (String humanMessage ) { 24return humanMessage .trim () 25 .chars () 26 .mapToObj (c ->m .get (String .valueOf ((char )c ))) 27 .collect (Collectors .joining ()); 28 } 29 30public String decode (String encodedMessage ) { 31String message =encodedMessage .trim (); 32String result ="" ; 33Map <String ,String >dec_map =m .entrySet ().stream ().collect ( 34Collectors .toMap (HashMap .Entry ::getValue ,HashMap .Entry ::getKey )); 35int pos =0 ; 36String current ="" ; 37do { 38int size =0 ; 39do { 40current =message .substring (pos , ++size +pos ); 41 }while (!dec_map .containsKey (current )); 42result +=dec_map .get (current ); 43pos +=size ; 44 }while (pos <message .length ()); 45return result ; 46 } 47}