strStr
Source
- leetcode: Implement strStr() | LeetCode OJ
- lintcode: lintcode - (13) strstr
Problem
For a given source string and a target string, you should output the first index(from 0) of target string in source string.
If target does not exist in source, just return -1.
Example
If source = "source" and target = "target", return -1.
If source = "abcdabcdefg" and target = "bcd", return 1.
Challenge
O(n2) is acceptable. Can you implement an O(n) algorithm? (hint: KMP)
Clarification
Do I need to implement KMP Algorithm in a real interview?
- Not necessary. When you meet this problem in a real interview, the interviewer may just want to test your basic implementation ability. But make sure your confirm with the interviewer first.
题解
对于字符串查找问题,可使用双重for循环解决,效率更高的则为KMP算法。
Python
class Solution:
def strStr(self, source, target):
if source is None or target is None:
return -1
for i in xrange(len(source) - len(target) + 1):
for j in xrange(len(target)):
if source[i + j] != target[j]:
break
else: # no break
return i
return -1
C++
class Solution {
public:
int strStr(string haystack, string needle) {
if (haystack.empty() && needle.empty()) return 0;
if (haystack.empty()) return -1;
if (needle.empty()) return 0;
if (haystack.size() < needle.size()) return -1;
for (int i = 0; i < haystack.size() - needle.size() + 1; i++) {
int j = 0;
for (; j < needle.size(); j++) {
if (haystack[i + j] != needle[j]) break;
}
if (j == needle.size()) return i;
}
return -1;
}
};
Java
/**
* http://www.jiuzhang.com//solutions/implement-strstr
*/
class Solution {
/**
* 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.
*/
public int strStr(String source, String target) {
if (source == null || target == null) {
return -1;
}
int i, j;
for (i = 0; i < source.length() - target.length() + 1; i++) {
for (j = 0; j < target.length(); j++) {
if (source.charAt(i + j) != target.charAt(j)) {
break;
} //if
} //for j
if (j == target.length()) {
return i;
}
} //for i
// did not find the target
return -1;
}
}
源码分析
- 边界检查:
source和target有可能是空串。 - 边界检查之下标溢出:注意变量
i的循环判断条件,如果是单纯的i < source.length()则在后面的source.charAt(i + j)时有可能溢出。 - 代码风格:
- 运算符
==两边应加空格 - 变量名不要起
s1``s2这类,要有意义,如target``source - 即使if语句中只有一句话也要加大括号,即
{return -1;} - Java 代码的大括号一般在同一行右边,C++ 代码的大括号一般另起一行
- int i, j;`声明前有一行空格,是好的代码风格。
- 运算符
- 是否在for的条件中声明
i,j,这个视情况而定,如果需要在循环外再使用时,则须在外部初始化,否则没有这个必要。
需要注意的是有些题目要求并不是返回索引,而是返回字符串,此时还需要调用相应语言的substring方法。
Python 代码中的else接的是for 而不是if, 其含义为no break, 属于比较 Pythonic 的用法,有兴趣的可以参考 4. More Control Flow Tools 的 4.4 节和 if statement - Why does python use 'else' after for and while loops?
复杂度分析
双重 for 循环,时间复杂度为 .