字符串匹配----暴力解法

字符串匹配暴力解法java代码实现：
匹配返回字符串的开始下标，未匹配返回-1

public class StringMatch {

	public static void main(String[] args) {
//		String var1 = "abccdfgabcd";
		String var1 = "abccabcdabcf";
		String var2 = "abcd";
		int result = stringMatch(var1, var2);
		System.out.println(result);
	}

	private static int stringMatch(String var1, String var2) {
		int slen = var1.length();
		int plen = var2.length();
		int i = 0;
		int j = 0;

		if (slen < plen) {
			return -1;
		}
		while (j < plen && i < slen) {
			if (var1.charAt(i) == var2.charAt(j)) {
				i++;
				j++;
			} else {
				i = i - j + 1;
				j = 0;
			}
		}
		if (j == plen) {
			return i - j;
		}
		return -1;
	}
}