# -*- coding: cp936 -*- ''' 文件比较算法: 算法模型参见: # 参考文章:http://blog.youkuaiyun.com/clariones/archive/2006/11/19/1396880.aspx # http://blog.youkuaiyun.com/clariones/archive/2006/11/24/1412394.aspx 1.确定最大匹配率 2.确定最优匹配路径 ''' left ='ABCACADF' right ='BCXCADFESBABCACA' all = [] # 创建矩阵,行数与列数均为left,right的长度+1,并将所有元素置0 for i in range(len(left)&nbs