简单记录
class Solution:
def maxValue(self , s , k ):
# 尽量大数在前
if len(s) <=k:
return int(s)
max_ans = 0
for i in range(len(s)-k+1):
num = int(s[i:i+k])
if num > max_ans:
max_ans = num
return max_ans 


京公网安备 11010502036488号