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: 2Example 2:
Input: haystack = "aaaaa", needle = "bba"
Output: -1解法
class Solution:
def strStr(self, haystack: 'str', needle: 'str') -> 'int':
if len(needle)<1:
return 0
length=len(needle)
for x in range(len(haystack)-length+1):
if haystack[x:x+length]==needle:
return x
return -1
