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: 2
题目的要求是寻找出haystack字符串中与needle相同的字符串,并返回相同字符串的初始下标。需要注意的边界情况是空字符和相同长度时的字符串情况。
想到的第一个思路是使用Python内置的函数find(),但是没有体现出算法的思想
class Solution:
def strStr(self, haystack: str, needle: str) -> int:
if needle == '':
return 0
result = haystack.find(needle)
return result
第二个思路是暴力求解,遍历haystack整个字符串来寻找:
class Solution:
def strStr(self, haystack: str, needle: str) -> int:
# if needle == '':
# return 0
# flag = 0
for i in range(len(haystack)-len(needle)+1):
if haystack[i:i+len(needle)] == needle:
return i
return -1
第三个思路是使用KMP算法:
class Solution:
def strStr(self, t, p):
"""
:type haystack: str
:type needle: str
:rtype: int
"""
if not p : return 0
_next = [0] * len(p)
def getNext(p, _next):
_next[0] = -1
i = 0
j = -1
while i < len(p) - 1:
if j == -1 or p[i] == p[j]:
i += 1
j += 1
_next[i] = j
else:
j = _next[j]
getNext(p, _next)
i = 0
j = 0
while i < len(t) and j < len(p):
if j == -1 or t[i] == p[j]:
i += 1
j += 1
else:
j = _next[j]
if j == len(p):
return i - j
return -1
但是KMP算法空间复杂度和时间复杂度都比较高,KMP算法明天再补上。
不得不感叹一下Python内置的函数较强。