auto save

my_Tetris.py

@@ -57,6 +57,7 @@ def check(center):
         if num_list[cube[0]-1][cube[1]-1] != 0:
         if num_list[cube[0]-1][cube[1]-1] != 0:
             return False
             return False
 
 
+
 num_list = []
 num_list = []
 for i in range(25):
 for i in range(25):
     num_list.append([0] * 15)
     num_list.append([0] * 15)
@@ -106,7 +107,6 @@ while True:
             states = False
             states = False
             for cude in current_pos:
             for cude in current_pos:
                 num_list[cube[0]-1][cube[1]-1] = color
                 num_list[cube[0]-1][cube[1]-1] = color
-
     # 将背景图画上去
     # 将背景图画上去
     screen.blit(background, (0, 0))
     screen.blit(background, (0, 0))
     # 计算出所有小方块的行、列位置
     # 计算出所有小方块的行、列位置
@@ -121,25 +121,25 @@ while True:
         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)
 
 
-    for i,row in zip(range(1,26),num_list):
-        for j,colors in zip(range(1,16),row):
+    for i, row in zip(range(1,26), num_list):
+        for j, colors in zip(range(1,16), row):
             if colors != 0:
             if colors != 0:
                 pygame.draw.rect(screen,colors,
                 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)
+                            (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 = []
     new_list = []
     for i in range(25):
     for i in range(25):
-        new_list.append([0]*15)
+        new_list.append([0] * 15)
     row_index = 24
     row_index = 24
-    for i in range(24,-1,-1):
+    for i in range(24, -1, -1):
         is_full = True
         is_full = True
-        for i in range(grid_num_width):
-            if uew_list[i][j] == 0:
+        for j in range(grid_num_width):
+            if num_list[i][j] == 0:
                 is_full = False
                 is_full = False
         if is_full == False:
         if is_full == False:
-            new_list[row_index] = unm_list[i]
+            new_list[row_index] = num_list[i]
             row_index -= 1
             row_index -= 1
         else:
         else:
             score += 1
             score += 1