您的位置:首页 > 其它

[LeetCode] Implement strStr()

2015-02-08 15:29 411 查看
Implement strStr().

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

Update (2014-11-02):
The signature of the function had been updated to return the index instead of the pointer. If you still see your function signature returns a
char *
or
String
, please click the reload button to reset your code definition.

思路:没用KMP,直接字符串比较,O(m*n)

class Solution {
public:
int strStr(char *haystack, char *needle) {

int hayLen = strlen(haystack);
int needLen= strlen(needle);

for(int i = 0; i <= hayLen-needLen; i++)
{
int k = i;
int j = 0;
for(/* */; j <needLen; /* */)
{
if(haystack[k] == needle[j])
{
k++;
j++;
}
else
break;
}
if(j == needLen)
return i;
}
return -1;

}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: