Embedded Files
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
Clarification:
What should we return when needle is an empty string? This is a great question to ask during an interview.
For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().
func strStr(haystack string, needle string) int {
if len(needle) == 0 {
return 0
}
var response int = -1
for i,ch := range haystack {
if string(needle[0]) == string(ch) &&
i+len(needle) <= len(haystack) &&
needle == haystack[i:i+len(needle)] {
return i
}
}
return response
}
class Solution:
def strStr(self, haystack, needle):
"""
:type haystack: str
:type needle: str
:rtype: int
"""
if len(needle) == 0:
return 0
for i in range(0, len(haystack)):
ch = haystack[i]
if(ch == needle[0] and haystack[i:i+len(needle)] == needle):
return i
return -1
Page updated
Report abuse