好难,只能暴力了
class Solution:
def longestDupSubstring(self, s: str) -> str:
ans = ""
for i in range(len(s)):
while s[i:i+len(ans)+1] in s[i+1:]:
ans = s[i:i+len(ans) + 1]
return ans
好难,只能暴力了
class Solution:
def longestDupSubstring(self, s: str) -> str:
ans = ""
for i in range(len(s)):
while s[i:i+len(ans)+1] in s[i+1:]:
ans = s[i:i+len(ans) + 1]
return ans