摘要: 4.代码 由1.中思路+性质(else),可得代码: void nxt() { n[0] = -1; int k = -1; int j = 0; while(j < t.length()) { if(k == -1 || t[j] == t[k]) { j++,k++; n[j] = k; } e 阅读全文
posted @ 2024-02-18 20:16 why?123 阅读(11) 评论(0) 推荐(0) 编辑