一、先降序排列,再查找E的值。序列号加1即为天数
二、将天数与骑车距离相比较即可
三、需考虑两种特殊情况,1、全部满足,2、全部不满足
n = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
for i in range(n):
if num[0] > i+1:
if num[i] > i+1:
if i == n-1:
e = n
break
elif num[i+1] <= i+2:
e = i+1
break
else:
e = 0
print(e)
有一个测试点非零返回。没有考虑到一个都不满足的情况(即num中最大值num[0]小于天数),导致e未被定义
n = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
for i in range(n):
if num[i] > i+1:
if i == n-1:
e = n
break
elif num[i+1] <= i+2:
e = i+1
break
print(e)
别人的代码,更加精简,满足条件,天数直接加1。num[i]>e+1等效于num[i]>i+1
n = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
e = 0
for i in range(n):
if num[i] > e + 1:
e += 1
print(e)