Skip to content
Toggle navigation
P
Projects
G
Groups
S
Snippets
Help
bellcode
/
lesson13-1
This project
Loading...
Sign in
Toggle navigation
Go to a project
Project
Repository
Issues
0
Merge Requests
0
Pipelines
Wiki
Snippets
Members
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Commit
f19e485c
authored
Oct 01, 2023
by
BellCodeEditor
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
save project
parent
76715518
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
28 additions
and
16 deletions
diy.py
diy.py
View file @
f19e485c
bingo_num
=
20
import
random
num_list
=
[
1
,
3
,
5
,
8
,
11
,
15
,
17
,
18
,
20
,
21
]
low
=
0
alist
=
[]
high
=
len
(
num_list
)
-
1
for
i
in
range
(
1
,
101
):
alist
.
append
(
i
)
while
low
<=
high
:
num
=
random
.
choice
(
alist
)
mid
=
(
low
+
high
)
//
2
guess_num
=
num_list
[
mid
]
def
binary_search
(
alist
,
num
):
if
guess_num
==
bingo_num
:
low
=
0
print
(
"找到了,他在列表里的索引是:"
,
mid
)
high
=
len
(
alist
)
-
1
break
elif
guess_num
<
bingo_num
:
low
=
mid
+
1
elif
guess_num
>
bingo_num
:
while
low
<=
high
:
high
=
mid
-
1
mid
=
(
low
+
high
)
//
2
\ No newline at end of file
guess
=
alist
[
mid
]
if
guess
==
num
:
return
mid
elif
guess
<
num
:
low
=
mid
+
1
elif
guess
>
num
:
high
=
mid
-
1
return
None
result
=
binary_search
(
alist
,
num
)
print
(
"lsgdsa:"
,
num
)
print
(
"asfsfsa"
,
result
)
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment