最接近数有序数组中数

#参数nums是一个整型排序数组
#参数target是一个整型数
#返回值是这个数组中最接近target的整数
class Solution:
def findPosition(self, A, target):
if not A:
return -1
start, end = 0,len(A)-1
while start+ 1<end:
mid = start +(end-start)//2
if A[mid]<target:
start= mid
elif A[mid]>target:
end = mid
else:
return mid
if target-A[start]<A[end]-target:
return start
else:
return end
#主函数
if name == ‘main’:
generator = [1,4,6]
target = 3
solution = Solution()
print(“输入：”, generator,",target =",target)
print(“输出：”, solution.findPosition(generator, target))