Introduction - If you have any usage issues, please Google them yourself
Enter the number of characters from the keyboard, statistics, the frequency of each character, the character frequency of occurrence as the node weights to build the Huffman tree, and then Huffman coding of individual characters, and finally print out each character and the corresponding Huffman Code