KMP
iyangdi
这个作者很懒,什么都没留下…
展开
-
Google算法题:H-Shortest Palindrome
http://www.jiuzhang.com/article/Google%202016%E5%B9%B412%E6%9C%88%20SDE%20Onsite%E9%9D%A2%E7%BB%8F/ https://leetcode.com/problems/shortest-palindrome/description/ Given a string S, you a原创 2017-08-21 23:04:06 · 253 阅读 · 0 评论 -
KMP算法的Java实现
http://blog.csdn.net/yutianzuijin/article/details/11954939/ int[] KMP(String s) { int n = s.length(); int[] next = new int[n]; //next[0]=; int j=0; for(int i=1; i<n; i++) { j = next原创 2017-08-22 12:34:47 · 180 阅读 · 0 评论