Description: In data encryption and data compression is often the need for special encoded string. Given an alphabet A is composed of 26 small write English letters A={a, b,... , z}. Ascending the alphabet string generated refers to string letter in the alphabet and the letters appear in accordance with the order from left to right the same as the order, and each character appears at most 1 times. For example, a, B, AB, BC, XYZ strings are ascending string. For ascending strings of arbitrary length of not more than 6, quickly calculate it in the dictionary coding.
To Search:
File list (Check if you may need any files):
encode1.cpp
最大覆盖问题算法设计cover.docx
encode.docx
Download