LeetCode 28. Implement strStr()

mplement strStr().

Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

Example 1:

Input: haystack = "hello", needle = "ll"
Output: 2

Example 2:

Input: haystack = "aaaaa", needle = "bba"
Output: -1

Clarification:

What should we return when needle is an empty string? This is a great question to ask during an interview.

For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().

方法１：暴力求解：

int strLen(char *str)
{
	int i = 0;
	while(str[i++] != '\0');
	return i-1;
}

int strStr(char *haystack, char *needle)
{
	int i, j;
	
	int len1 = strLen(haystack);
	int len2 = strLen(needle);

	for(i = 0; i <= len1 -len2; ++i)
	{
		for(j = 0; j < len2; ++j)
		{
			if(haystack[i+j] != needle[j] )
			{
				break;
			}
		}

		if(j == len2-1)
		{
			return i;
		}
	}

	return -1;
}

耗时大约４毫秒

方法二：　KMP算法：

int strLen(char *str)
{
	int i = 0;
	while(str[i++] != '\0');
	return i-1;
}

int *get_array(char *needle)
{
	int len = strLen(needle);
	int *array = (int *)malloc((len+1) * sizeof(int));
	
	array[0] = 0;
	if(len > 0)
	{
		array[1] = 0;
	}
	
	int i;
	int j = 0;

	for(i = 1; i < len; ++i)
	{
		
		while( j > 0 && needle[j] != needle[i])
		{
			j = array[j];
		}
		if(needle[j] == needle[i])
		{
			++j;
		}

		array[i+1] = j;
	}
	

	return array;
}


int strStr(char *haystack, char *needle)
{
	int len2 = strLen(needle);
	if(len2 == 0)
	{
		return 0;
	}

	int *array = get_array(needle);
	
	int i, j = 0;
	int len1 = strLen(haystack);

	for(i = 0; i < len1; ++i)
	{
		while(j > 0 && haystack[i] != needle[j])
		{
			j = array[j];
		}
		
		if(haystack[i] == needle[j])
		{
			j++;
		}

		if(j == len2)
		{
			free(array);
			return i-len2+1; 
		}
	}	

	free(array);

	return -1;
}

耗时０毫秒。。