python3:
每日一题困难题 最后抄了大佬的暴力 emmmm 就这样吧
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