总结
本文实例讲述了python字符串匹配算法kmp。分享给大家供大家参考。具体如下：
#!/usr/bin/env python #encoding:utf8 def next(pattern): p_len = len(pattern) pos = [-1]*p_len j = -1 for i in range(1, p_len): while j > -1 and pattern[j+1] != pattern[i]: j = pos[j] if pattern[j+1] == pattern[i]: j = j + 1 pos[i] = j return pos def kmp(ss, pattern): pos = next(pattern) ss_len = len(ss) pattern_len = len(pattern) j = -1 for i in range(ss_len): while j > -1 and pattern[j+1] != ss[i]: j = pos[j] if pattern[j+1] == ss[i]: j = j + 1 if j == pattern_len-1: print 'matched @: %s' % str(i-pattern_len+1) j = pos[j] kmp(u'上海自来水来自海上海', u'上海')
希望本文所述对大家的Python程序设计有所帮助。
python怎么学习？python怎么入门？python在哪学？python怎么学才快？不用担心，这里为大家提供了python速学教程(入门到精通)，有需要的小伙伴保存下载就能学习啦！
广告![ThinkPHP5快速开发企业站点[全程实录]](https://img.php.cn/upload/course/000/000/068/6253d918a3ce7278.png)
收藏
收藏
Copyright 2014-2025 https://www.php.cn/ All Rights Reserved | php.cn | 湘ICP备2023035733号
下载豆包电脑版，提高工作效率
857
