题目
**链接:https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/description/
我的解答
class Solution:
def strStr(self, haystack: str, needle: str) -> int:
h_length = len(haystack)
n_length = len(needle)
if h_length < n_length:
return -1
else:
i = 0
while i <= h_length-n_length:
if needle == haystack[i:n_length+i]:
return i
i = i + 1
return -1
思路分析
1、如果haystack长度小于needle长度,则必定-1
2、使用needle的长度对haystack进行切割并比较,找到则返回当前的坐标i,找不到则返回-1