本文共 618 字，大约阅读时间需要 2 分钟。
Codewars第三天–Largest 5 digit number in a series
In the following 6 digit number:283910
91 is the greatest sequence of 2 consecutive digits.
In the following 10 digit number:
1234567890
67890 is the greatest sequence of 5 consecutive digits.
Complete the solution so that it returns the greatest sequence of five consecutive digits found within the number given. The number will be passed in as a string of only digits. It should return a five digit integer. The number passed may be as large as 1000 digits.
def solution(digits): numlist = [int(digits[i:i+5]) for i in range(0,len(digits)-4)] return max(numlist)
转载地址：http://ammws.baihongyu.com/