class Solution:
def strStr(self, haystack: str, needle: str) -> int:
m=len( haystack)
n=len( needle)
for i in range(m):
if haystack[i:i+n]==needle:
return i
return -1
class Solution:
def strStr(self, haystack: str, needle: str) -> int:
m=len( haystack)
n=len( needle)
for i in range(m):
if haystack[i:i+n]==needle:
return i
return -1