串编辑和LZW压缩算法设计

String Editing and LZW Compression Algorithm Design

串编辑一类字符串转换的问题,将两个字符串按照某种规则进行转换,转换将有三个消费函数,利用动态规划的方法可以得到各个操作的耗费之和,解决串编辑的问题。利用HASH链式散列来实现LZW压缩方法,利用字典组织,节省空间降低算法的复杂度,从而达到快速的代码简化法。

String editing a class of string conversion problem,the two strings are converted according to a certain rule,the conversion will have three consumption functions,using the dynamic programming method can get the sum of the cost of each operation,solve the problem of string editing. LASH compression method is implemented by HASH chain hashing,which uses dictionary organization to save space and reduce the complexity of the algorithm,thus achieving fast code simplification.