问题描述:
Implement 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
解决方法:
用两个for循环,从第一个位置开始提取与needle相同的字符串进行比较。
代码如下:
class Solution {
public:
int strStr(string haystack, string needle) {
string str;
if ((haystack.size() == 0 && needle.size() == 0)||haystack ==needle) return 0;
if ((haystack.size() == 0 && needle.size() != 0)||haystack.size() < needle.size())
return -1;
for (int i = 0; i < haystack.size()- needle.size()+1; i++)
{
str = "";
for (int j = 0; j < needle.size(); j++)
str += haystack[i+j];
if (str == needle)
return i;
}
return -1;
}
};