BF算法（java版本）

public class BF {
	public static int BFMatch(String a,String b){
		 //boolean c = a.contains(b);
		long beginTimes = System.currentTimeMillis();
		int i = 0;
		while(i<a.length()){
			int j = 0;
			while(j<b.length()&&a.charAt(i)==b.charAt(j)){
				i++;
				j++;
			}
			if(j==b.length()){
				System.out.println("BF execute times:"+(System.currentTimeMillis()-beginTimes));
				System.out.println(i - b.length());
				return i - b.length();
			}
			i=i-j+1;
			System.out.println(i);
		}
		System.out.println("BF execute times:"+(System.currentTimeMillis()-beginTimes));
		return -1;
	}
	public static void main(String[] args){
		String a = "ababcababa";
		String b = "ababa";
		BFMatch(a,b);
	}
}