输入:
abcd12345ed125ss123058789 a8a72a6a5yy98y65ee1r2
输出:
123058789,9 729865,2
说明:
样例一最长的数字子串为123058789,长度为9 样例二最长的数字子串有72,98,65,长度都为2
while True:
try:
strl= input()
import re
a = re.findall(r"[0-9]+", strl)
temp = max([len(i) for i in a])
data = []
for i in a:
if len(i)==temp:
data.append(i)
else:
continue
print("".join(map(str,data)),end=",")
print(temp)
except EOFError:
break
思路:先正则匹配所有数字,然后用条件计算字符串长度以及输出