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
思路
搜索字符串中的子串,发现子串第一次出现的位置
可以以子串形成一个小窗口,不断在整个字符串中移动即可
class Solution:
def strStr(self, haystack: str, needle: str) -> int:
# 减小判断的边界
for i in range(len(haystack) - len(needle) + 1):
if haystack[i:i + len(needle)] == needle:
return i
return -1