POJ3461 KMP

T = "ababaaba"的Next数组为 [-1, 0, 1, 2, 3, 1, 2, 3]

再次感悟KMP

import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

public class Main {
	public static void main(String[] args) {
		new Task().solve() ; 
	}
}

class Task{
	InputReader in = new InputReader(System.in) ;
	PrintWriter out = new PrintWriter(System.out) ;
	void solve(){
		int t = in.nextInt() ; 
		while(t-- > 0){
		    out.println(new KMP(in.next().toCharArray()).searchFrom(in.next().toCharArray())) ;
	    }
		out.flush() ;
	}
}

class KMP {
	int m;
	char[] word ;
	int[] fail;

	KMP(char[] word) {
		m = word.length;
		this.word = word;
		fail = new int[m + 1];
		int crt = fail[0] = -1;
		for (int i = 1; i <= m; i++) {
			while (crt >= 0 && word[crt] != word[i - 1])
				crt = fail[crt];
			fail[i] = ++crt;
		}
	}

	int searchFrom(char[] text) {
		int n = text.length, count = 0;
		for (int i = 0, j = 0; i < n; i++) {
			while (j >= 0 && text[i] != word[j])
				j = fail[j];
			if (++j == m) {
				count++;
				j = fail[j];
			}
		}
		return count;
	}
}


class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = new StringTokenizer("");
	}

	private void eat(String s) {
		tokenizer = new StringTokenizer(s);
	}

	public String nextLine() {
		try {
			return reader.readLine();
		} catch (Exception e) {
			return null;
		}
	}

	public boolean hasNext() {
		while (!tokenizer.hasMoreTokens()) {
			String s = nextLine();
			if (s == null)
				return false;
			eat(s);
		}
		return true;
	}

	public String next() {
		hasNext();
		return tokenizer.nextToken();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

	public BigInteger nextBigInteger() {
		return new BigInteger(next());
	}

}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值