28. 找出字符串中第一个匹配项的下标
class Solution:
def strStr(self, haystack: str, needle: str) -> int:
for i in range(0,len(haystack)-len(needle)+1):
if haystack[i:i+len(needle)] == needle:
return i
return -1
class Solution:
def strStr(self, haystack: str, needle: str) -> int:
for i in range(0,len(haystack)-len(needle)+1):
if haystack[i:i+len(needle)] == needle:
return i
return -1