题解 | #最长重复子串#Python 暴力向
最长重复子串
http://www.nowcoder.com/practice/4fe306a84f084c249e4afad5edf889cc
class Solution:
def solve(self , a ):
# write code here
if len(a) < 2:
return 0
for leng in range(len(a)//2, 0, -1):
for i in range(0, len(a)-2*leng+1):
if a[i:i+leng] == a[i+leng:i+2*leng]:
return 2*leng
return 0
顺丰集团工作强度 328人发布