我有一个清单。
我想找出列表中的哪个数字在最高和最低之间最接近 k，但不使用 lambda 或 abs。我该怎么做？
a=[1,5,8,4,9,25,10,16,54]
k=12
highest = max(a)
lowest = min(a)
【问题讨论】：
abs 和 lambda 都是 python 的内置特性。
bisect 与这些有什么关系？以及所有答案都使用abs 或lambda 的问题如何被欺骗？
标签： python
a=[1,5,8,4,9,25,10,16,54]
k=12
import sys
def func(lis, val):
# minimum_difference is used to check the difference between value in list and key we have and it will keep record of minimum difference
minimum_difference = sys.maxsize
# nearest_value will save the list value for which we got minimum difference
nearest_value = None
# iterating through the list elements
for i in lis:
# getting the difference b/w key value and list element
difference_key_element = val - i
# checking if difference is neagtive or not, if negative make
# it positive
if difference_key_element<0:
difference_key_element *= -1
# checking if minimum value we find so far, is less then the
# current difference b/w key value and element value
# if it is less then the current min value, replace it
# and store the list element in the store variable
if difference_key_element<minimum_difference:
minimum_difference=difference_key_element
nearest_value = i
# return the store variable
return nearest_value
solution = func(a, k)
print(solution)
输出
10
【讨论】：
试试这个棘手的代码，
代码语法
for each in sorted(a):
if each < k:
lowest = each
else:
highest = each
break
print(f"Original List: {a}\nLowest according to ({k}): {lowest}\nHighest according to ({k}): {highest}")
输出
Original List: [1, 5, 8, 4, 9, 25, 10, 16, 54]
Lowest according to (12): 10
Highest according to (12): 16
[Program finished]
【讨论】：