A牛打怪求教取max(最大值,最小值+n-1)的问题出在哪呢
class Solution:
def Minimumdays(self , n , DEF ):
# write code here
mi,ma = DEF[0],DEF[0]
for i in range(len(DEF)):
if DEF[i] < mi:
mi = DEF[i]
if DEF[i] > ma:
ma = DEF[i]
return max(mi+n-1,ma)
def Minimumdays(self , n , DEF ):
# write code here
mi,ma = DEF[0],DEF[0]
for i in range(len(DEF)):
if DEF[i] < mi:
mi = DEF[i]
if DEF[i] > ma:
ma = DEF[i]
return max(mi+n-1,ma)
投递快手等公司10个岗位 >