class Solution(object):
def maxA(self, N):
res = [0, 1]
for i in range(2, N+1):
last = i
for j in range(1, i-2):
last = max(last, res[j]*(i-j-1))
last = max(res[-1]+1, last)
res.append(last)
return res[-1]
Python, LintCode, 867. 四键键盘
最新推荐文章于 2023-03-29 22:29:12 发布