题解 | #子串计算#Python版代码
子串计算
https://www.nowcoder.com/practice/bcad754c91a54994be31a239996e7c11
from collections import Counter
s = input()
counter = Counter(s[i:j] for i in range(len(s)) for j in range(i + 1, len(s) + 1))
for num, count in sorted(counter.items()):
if (count > 1): print(num, count)
腾讯公司氛围 465人发布
投递腾讯等公司6个岗位 >
腾讯三面341人在聊