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
实现 strStr() 函数。
给定一个 haystack 字符串和一个 needle 字符串,在 haystack 字符串中找出 needle 字符串出现的第一个位置 (从0开始)。如果不存在,则返回 -1。
完整代码:
class Solution {
public:
int strStr(string haystack, string needle) {
if (needle.empty()) return 0;
int sizeA = haystack.size(), sizeB = needle.size();
int idx = -1;
for (int i=0; i<= sizeA-sizeB; i++){
bool flag = true;
for (int j=0; j< sizeB; j++){
if (haystack[j+i] != needle[j]){
flag = false;
break;
}
}
if (flag){
idx = i;
break;
}
}
return idx;
}
};