| 21 | } |
| 22 | |
| 23 | public static void encode(String str,int[] arr) |
| 24 | { |
| 25 | PriorityQueue<Node> queue=new PriorityQueue<>(new Comparator<Node>() |
| 26 | { |
| 27 | @Override |
| 28 | public int compare(Node n1,Node n2) |
| 29 | { |
| 30 | if(n1.freq==n2.freq) |
| 31 | return 1; |
| 32 | return n1.freq-n2.freq; |
| 33 | } |
| 34 | } |
| 35 | ); |
| 36 | for(int i=0;i<str.length();i++) |
| 37 | { |
| 38 | Node node=new Node(""+str.charAt(i),arr[i],null,null); |
| 39 | queue.add(node); |
| 40 | } |
| 41 | while(queue.size()>1) |
| 42 | { |
| 43 | Node node1=queue.remove(); |
| 44 | Node node2=queue.remove(); |
| 45 | Node node=new Node(node1.name+node2.name,node1.freq+node2.freq,node1,node2); |
| 46 | queue.add(node); |
| 47 | } |
| 48 | huffmanencode(queue.peek(),""); |
| 49 | } |
| 50 | |
| 51 | public static void huffmanencode(Node root,String res) |
| 52 | { |