9.23美团算法策略方向笔
1、n场考试求,求低于或高于之前所有考试的最高分
遍历一次数组,记录最大值最小值,很简单
2、求修改后的时间
'''python
hour, minute = map(int, input().split(':'))
n = int(input())
for i in range(n):
op , step = input().split()
step = int(step)
if op == '+':
if minute + step <= 60:
minute = minute + step
else:
hour += (minute +step) // 60
hour %= 24
minute = (minute +step) % 60
else:
if minute - step >= 0:
minute = minute - step
else:
step -= minute
hour_tmp = step // 60
minute_temp = step % 60
if hour - hour_tmp - 1 >= 0:
hour = hour - tmp -1
minute = 60 - minute_temp
else:
hour_tmp -= hour
hour_tmp_01 = hour_tmp % 24
hour = 24 - hour_tmp_01 - 1
if hour == 24:
hour = 0
minute = 60 - minute_temp
if hour < 10:
hour = '0' + str(hour)
else:
hour = str(hour)
if minute < 10:
minute = '0' + str(minute)
else:
minute = str(minute)
res = str(hour) +':'+str(minute)
print(res)
'''
3、数列的前n项和
暴力超时间,等差数列求和公式,感觉步骤没错(我没有ak),不理解。
4、求敌营乘以x不是完全平方数的元素,
感觉也很简单,但是未ak,不理解
有人全部通过了吗,如何做的???