leetcode28:Implement strStr()

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Somnus_k/article/details/82629936

思路:直接采用了暴力匹配。

代码:

public class ImplementstrStr28 {

	public static void main(String[] args) {

		String haystack = "", needle = "";
		System.out.println(new ImplementstrStr28().strStr(haystack, needle));
	}

	public int strStr(String haystack, String needle) {

		char[] ch = haystack.toCharArray();
		char[] c = needle.toCharArray();
		int len = c.length;
		for (int i = 0; i <= ch.length - len; i++) {
			if (isMathch(ch, i, i + len, c))
				return i;
		}
		return -1;

	}

	public boolean isMathch(char[] ch, int i, int len, char[] c) {
		int idx = 0;
		for (int k = i; k < len; k++) {
			if (ch[k] != c[idx])
				return false;
			idx++;
		}
		return true;
	}
}

输出:0

猜你喜欢

转载自blog.csdn.net/Somnus_k/article/details/82629936