Basic solution for string matching algorithm.

StringMatching.java

public class StringMatching {
	
	private static boolean contains(String a, String b) {
		int i = 0;
		int n1 = a.length();
		int n2 = b.length();
		char[] ch1 = a.toCharArray();
		char[] ch2 = b.toCharArray();
		
		while (i < n1) {
			int temp = i;
			int j;
			for (j = 0; j < n2; j++) {
				if (ch1[i] == ch2[j]) {
					i++;
				} else {
					i = temp + 1;
					break;
				}
			}
			if (j == n2) {
				return true;
			}
		
		}
		
		return false;
	}
	
	public static void main(String[] args) {
		String a = "abcdeabdeabcdf";
		String b = "abcdf";
		
		System.out.println(contains(a, b));
	}
}