KMP算法学习
摘要:
先贴上一点代码,等脑子清醒点再好好理解// 求next数组 public static int[] getNext(String pattern) { int len = pattern.length(); char[] pattern_ary = pattern.toCharArray(); int i = 0; int[] next = new int[len]; next[0] = -1; int j = -1; while(i < len - 1){ if(j == -1 || pattern_ary[i] == pattern_ary[j]... 阅读全文
posted @ 2012-03-06 23:31
hercules
阅读(144)
评论(0)
推荐(0)
浙公网安备 33010602011771号