-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path求字符串子串中个数最多的子串.py
47 lines (42 loc) · 1.2 KB
/
求字符串子串中个数最多的子串.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time : 2019/8/31 17:07
# @Author : SeniorZhu1994
# @Email : SeniorZhu1994@
# @Site :
# @File : 求字符串子串中个数最多的子串.py
# @Software: PyCharm
# @Describe:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time : 2019/8/29 10:40
# @Author : SeniorZhu1994
# @Email : SeniorZhu1994@foxmail.com
# @Site :
# @File : 求字符串所有子串-连续的.py
# @Software: PyCharm
# @Describe:
def cutStr2(str):
ls_cut = []
for i in range(len(str)): # 从字符串的第 i个元素开始向后截取
for j in range(len(str)-i): # 以第 i个元素开头的截取所有字符串的个数为 len(str)-i个
ls_cut.append(str[i:i+j+1])
# ls_cut = list(set(ls_cut))
# print(ls_cut)
return ls_cut
def cutStr(str):
ls_cut = []
for i in range(len(str)):
for j in range(i + 1, len(str)+1):
sub = str[i:j]
ls_cut.append(sub)
return ls_cut
if __name__ == '__main__':
str_in = input()
ls_cut = cutStr(str_in)
count = 0
for item in ls_cut:
if ls_cut.count(item)>count:
count = ls_cut.count(item)
# print(item)
print(count)