class Half_Find():
def __init__(self, list1, num1):
self.list1 = list1
self.num1 = num1
def h_find(self):
if len(self.list1) == 0 or len(self.num1) == 0:
return '数据不能为空'
self.num1 = int(self.num1)
self.list1 = list(self.list1)
self.list1 = [int(self.list1[i]) for i in range(len(self.list1))]
self.list1.sort()
i = 0
j = len(self.list1) - 1
while i <= j:
mid = (i + j) // 2
if self.list1[mid] == self.num1:
return '找到了,值:', self.num1
else:
if self.num1 < self.list1[mid]:
j = mid - 1
else:
i = mid + 1
if i > j:
return '未找到'
if __name__ == '__main__':
li = input('请输入序列:')
num = input('请输入需要查找数字:')
find1 = Half_Find(li, num)
print(find1.h_find())