Commit 140b7fc1 by BellCodeEditor

auto save

parent d621a15f
Showing with 36 additions and 24 deletions
import random # import random
alist=[] # alist=[]
for i in range(1, 101): # for i in range(1, 101):
alist.append(i) # alist.append(i)
num = random.choice(alist) # num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置 # # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num): # def binary_search(alist,num):
low=0 # low=0
high=len(alist)-1 # high=len(alist)-1
while low<=high: # while low<=high:
mid=(low+high)//2 # mid=(low+high)//2
guess=alist[mid] # guess=alist[mid]
if guess==num: # if guess==num:
return mid # return mid
elif guess<num: # elif guess<num:
low=mid+1 # low=mid+1
else: # else:
high=mid-1 # high=mid-1
return None # return None
result=binary_search(alist,num) # result=binary_search(alist,num)
print(num) # print(num)
print(result) # print(result)
# a=input(int('0,100的数')) # a=input(int('0,100的数'))
# while i==a: # while i==a:
# if i==a: # if i==a:
...@@ -36,4 +36,17 @@ print(result) ...@@ -36,4 +36,17 @@ print(result)
# b=input(int()) # b=input(int())
# if i==b: # if i==b:
# print("找到了") # print("找到了")
# break # break
\ No newline at end of file a=int(input("三位数"))
b=a//100
c=a//10%10
v=a//1%10
if b>c and b>v:
print(b)
elif c>b and c>v:
print(c)
else:
print(v)
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment