Description: If you save a single word list, compression methods can be used as storage space. If the suffix of the same two words, you can use the same storage space to save the same suffix. For example, the original list were used to save a single word Str1 "abcdef" and the word Str2 "dbdef", the compressed storage in the form below.
Please complete the design of an efficient algorithm for two single linked list of compressed storage, and estimate the time you design algorithm complexity.
Requirements: Read the default code, write a function SNODE* ziplist (SNODE* head1, SNODE* head2)
ziplist features are: two strings in the list, find the common suffix, if common suffix, the suffix compression and returns a pointer pointing to the public or NU
To Search:
File list (Check if you may need any files):
pro.doc
Download