5367. 最长快乐前缀
思路:前面切=后面切,python.kmp算法待学。
class Solution:
def longestPrefix(self, s: str) -> str:
for i in range(len(s)-1, 0, -1):
s1 = s[0:i]
s2 = s[-i::]
if s1==s2:
return s1
return ""