题解 | #相差不超过k的最多数#没人写py?
相差不超过k的最多数
http://www.nowcoder.com/practice/562630ca90ac40ce89443c91060574c6
没人写py?
n,k = map(int,input().split())
lis = list(map(int,input().split()))
list.sort(lis)
left = 0
right = 0
max1 =0
sub = 0
while(right<len(lis)):
sub = lis[right]-lis[left]
while(sub>k):
left += 1
break
if(max1<right-left+1 or max1==0):
max1 = right-left+1
right += 1
print(max1)
卓越教育公司福利 132人发布