[Leetcode] 28. Implement strStr()
2015-03-14 03:36
260 查看
Implement strStr().
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
有空还是要熟悉一下KMP
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
有空还是要熟悉一下KMP
public class Solution { public int strStr(String haystack, String needle) { if(haystack == null || needle == null) return -1; if(haystack.length() < needle.length()) return -1; int i = 0; int j = 0; for(i = 0; i < haystack.length() - needle.length() + 1; i++){ for(j = 0; j < needle.length(); j++){ if(haystack.charAt(i + j) != needle.charAt(j)) break; } if(j == needle.length()) return i; } return -1; } }
相关文章推荐
- LeetCode - 28. Implement strStr()
- LeetCode 28. Implement strStr()
- Leetcode-28. Implement strStr()
- leetcode28. Implement strStr()
- leetcode 28. Implement strStr()
- Leetcode 28. Implement strStr()
- leetCode 28. Implement strStr() 字符串
- 【LeetCode】28. Implement strStr()
- Leetcode题解 28. Implement strStr()
- LeetCode28. Implement strStr()
- leetcode题解-28. Implement strStr() && 521. Longest Uncommon Subsequence I && 522 II
- Leetcode -- 28. Implement strStr()
- (Java)LeetCode-28. Implement strStr()
- LeetCode-28. Implement strStr()
- leetcode 28. Implement strStr()
- Leetcode 28. Implement strStr()
- LeetCode 28. Implement strStr()
- 【LeetCode】28. Implement strStr() (2 solutions)
- 【leetcode】28. Implement strStr()
- 个人记录-LeetCode 28. Implement strStr()