Skip to content
Toggle navigation
P
Projects
G
Groups
S
Snippets
Help
Administrator
/
pygame_lesson12_diy01
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
9d8ede2e
authored
3 years ago
by
BellCodeEditor
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
auto save
parent
1b4f6616
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
39 additions
and
0 deletions
my_Tetris.py
my_Tetris.py
View file @
9d8ede2e
...
@@ -47,6 +47,11 @@ cube_colors = [
...
@@ -47,6 +47,11 @@ cube_colors = [
(
255
,
204
,
0
),
(
204
,
0
,
51
),(
255
,
0
,
51
),
(
0
,
102
,
153
),
(
255
,
204
,
0
),
(
204
,
0
,
51
),(
255
,
0
,
51
),
(
0
,
102
,
153
),
(
153
,
0
,
51
),
(
204
,
255
,
102
),
(
255
,
153
,
0
)]
(
153
,
0
,
51
),
(
204
,
255
,
102
),
(
255
,
153
,
0
)]
# 创建一个含有25个小列表,每个小列表都有15个元素,每个元素的值都是0的列表
num_list
=
[]
# 创建空列表存储最终的列表元素并命名为num_list
for
i
in
range
(
25
):
# 使用for循环让程序重复执行25次
num_list
.
append
([
0
]
*
15
)
# 用num_list.append()方法将小列表添加到打列表里
def
check
(
center
):
def
check
(
center
):
for
cube
in
current_shape
:
for
cube
in
current_shape
:
cube
=
(
cube
[
0
]
+
center
[
0
],
cube
[
1
]
+
center
[
1
])
cube
=
(
cube
[
0
]
+
center
[
0
],
cube
[
1
]
+
center
[
1
])
...
@@ -54,6 +59,9 @@ def check(center):
...
@@ -54,6 +59,9 @@ def check(center):
if
cube
[
0
]
<
1
or
cube
[
1
]
<
1
or
cube
[
0
]
>
grid_num_height
\
if
cube
[
0
]
<
1
or
cube
[
1
]
<
1
or
cube
[
0
]
>
grid_num_height
\
or
cube
[
1
]
>
grid_num_width
:
or
cube
[
1
]
>
grid_num_width
:
return
False
return
False
# if判断小方块所在的网格在列表num_list里面对应的值不等于0
if
num_list
[
cube
[
0
]
-
1
][
cube
[
1
]
-
1
]
!=
0
:
return
False
# 返回False
while
True
:
while
True
:
for
event
in
pygame
.
event
.
get
():
for
event
in
pygame
.
event
.
get
():
...
@@ -98,6 +106,10 @@ while True:
...
@@ -98,6 +106,10 @@ while True:
if
check
(
center
)
==
False
:
if
check
(
center
)
==
False
:
center
[
0
]
=
center
[
0
]
-
1
center
[
0
]
=
center
[
0
]
-
1
states
=
False
states
=
False
# for循环进行遍历取出每一个小方块的行、列位置
for
cube
in
current_pos
:
# 用它们减去1作为索引找到对应的值改成俄罗斯方块的颜色
num_list
[
cube
[
0
]
-
1
][
cube
[
1
]
-
1
]
=
color
# 将背景图画上去
# 将背景图画上去
screen
.
blit
(
background
,
(
0
,
0
))
screen
.
blit
(
background
,
(
0
,
0
))
# 计算出所有小方块的行、列位置
# 计算出所有小方块的行、列位置
...
@@ -111,6 +123,33 @@ while True:
...
@@ -111,6 +123,33 @@ while True:
(
cube
[
1
]
*
20
-
20
,
cube
[
0
]
*
20
-
20
,
20
,
20
),
0
)
(
cube
[
1
]
*
20
-
20
,
cube
[
0
]
*
20
-
20
,
20
,
20
),
0
)
pygame
.
draw
.
rect
(
screen
,
(
255
,
255
,
255
),
pygame
.
draw
.
rect
(
screen
,
(
255
,
255
,
255
),
(
cube
[
1
]
*
20
-
20
,
cube
[
0
]
*
20
-
20
,
20
,
20
),
1
)
(
cube
[
1
]
*
20
-
20
,
cube
[
0
]
*
20
-
20
,
20
,
20
),
1
)
# 创建一个1-25的列表进行遍历(记录行的位置)
for
i
,
row
in
zip
(
range
(
1
,
26
),
num_list
):
# 创建一个1-15的列表进行遍历(记录列的位置)
for
j
,
colors
in
zip
(
range
(
1
,
16
),
row
):
if
colors
!=
0
:
# if判断每一个格子对应的值不等于0
# 用pygame.draw.rect()方法画出小方块
pygame
.
draw
.
rect
(
screen
,
colors
,
(
j
*
20
-
20
,
i
*
20
-
20
,
20
,
20
))
pygame
.
draw
.
rect
(
screen
,
(
255
,
255
,
255
),
(
j
*
20
-
20
,
i
*
20
-
20
,
20
,
20
),
1
)
new_list
=
[]
# 新的地图列表
for
i
in
range
(
25
):
new_list
.
append
([
0
]
*
15
)
row_index
=
24
for
i
in
range
(
24
,
-
1
,
-
1
):
is_full
=
Ture
for
j
in
range
(
grid_num_width
):
if
num_list
[
i
][
j
]
==
0
:
is_full
=
False
if
is_full
==
False
:
new_list
[
row_index
]
=
num_list
[
i
]
row_index
-=
1
else
:
score
+=
1
num_list
=
new_list
# 得分
# 得分
text_surface
=
font
.
render
(
str
(
score
),
True
,
(
0
,
0
,
0
))
text_surface
=
font
.
render
(
str
(
score
),
True
,
(
0
,
0
,
0
))
screen
.
blit
(
text_surface
,
(
350
,
70
))
screen
.
blit
(
text_surface
,
(
350
,
70
))
...
...
This diff is collapsed.
Click to expand it.
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