C#实现Huffman编码和解码

 

1. using System;
2. using System.Collections;
3. using System.Collections.Generic;
4. using System.Linq;
5. using System.Text;
7. namespace StringCompresser
8. {
10.     public class Huffman
11.     {
12.         //char and its bitarray
13.         public Dictionary<char, BitArray> HuffmanCode = null;
15.         //Huffman tree
16.         public Node[] HuffmanTree = null;
18.         //huffman tree node
19.         internal struct Node
20.         {
21.             internal char character;
22.             internal int weight;
23.             internal int parent;
24.             internal int lchild;
25.             internal int rchild;
26.         }
28.         public Huffman(char[] charArray, int[] weight)
29.         {
30.             if (weight == null || weight.Length == 0 
31.                 || charArray == null || charArray.Length == 0
32.                 || weight.Length != charArray.Length)
33.                 return;
35.             HuffmanCode = new Dictionary<char, BitArray>();
37.             //build huffman tree
39.             int totalNodeNum = weight.Length * 2 - 1;
41.             HuffmanTree = new Node[t