[LeetCode] Implement strStr()

char *strStr(char *haystack, char *needle) {
	if (haystack == NULL || needle == NULL){
		return NULL;
	}
	int haystack_len = strlen(haystack);
	int needle_len = strlen(needle);
	for(int i = 0; i <= haystack_len - needle_len; i++) {
		char* p_haystack = haystack + i;
		char* p_needle = needle;
		while(*p_needle != 0) {
			if(*p_haystack != *p_needle) {
				break;
			}
			p_haystack++;
			p_needle++;
		}
		if(*p_needle == 0) {
			return haystack+i;
		}
	}
	return NULL;
}

用strlen()确定两个字符串的长度,
二者之差即为haystack指针移位的上限

你可能感兴趣的:(LeetCode,刷题)