class Solution {
public:
/**
* Returns a index to the first occurrence of target in source,
* or -1 if target is not part of source.
* @param source string to be scanned.
* @param target string containing the sequence of characters to match.
*/
// write your code here
int strStr(string source, string target) {
if (source.length() == 0 || target.length() == 0)
return -1;
for (int i = 0; i < source.length() - target.length()+1; i++) {
int j = 0;
for (j = 0; j < target.length(); j++) {
if (source[i + j] != target[j])
break;
}
if (j == target.length())
return i;
}
return -1;
}
};
lass Solution {
public:
/**
* Returns a index to the first occurrence of target in source,
* or -1 if target is not part of source.
* @param source string to be scanned.
* @param target string containing the sequence of characters to match.
*/
// write your code here
int strStr(string source, string target) {
if (source.length() == 0 || target.length() == 0)
return -1;
for (int i = 0; i < (int)(source.length() - target.length()+1); i++) {
int j = 0;
for (j = 0; j < (int)(target.length()); j++) {
if (source[i + j] != target[j])
break;
}
if (j == (int)(target.length()))
return i;
}
return -1;
}
};
版权声明:本文内容由阿里云实名注册用户自发贡献,版权归原作者所有,阿里云开发者社区不拥有其著作权,亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容,填写侵权投诉表单进行举报,一经查实,本社区将立刻删除涉嫌侵权内容。