Python：每日一题 148

冬雪雪冬 · 发表于 2018-2-5 10:12:21

马上注册，结交更多好友，享用更多功能^_^

您需要登录才可以下载或查看，没有账号？立即注册

x

本帖最后由冬雪雪冬于 2018-2-8 20:49 编辑

我们的玩法做了一下改变：

1. 楼主不再提供答案。
2. 请大家先独立思考”，再参考其他鱼油的解答，这样才有助于自己编程水平的提高。
3. 鼓励大家积极答题，奖励的期限为出题后24小时内。
4. 根据答案的质量给予1~3鱼币的奖励。

题目：
我们都玩过windows的小游戏挖雷。现在告诉你雷在哪里，请标出其他位置的代表周围雷数量的数字。
例如5*5的雷场中有如下4颗雷

则标出的数字为

请你标出10*10雷场的各个空位的数字。

jerryxjr1220 · 发表于 2018-2-5 11:48:07

本帖最后由 jerryxjr1220 于 2018-2-5 12:11 编辑

matrix_string = '''
MM
M
MM
M
M
MM
M M
M '''
matrix = matrix_string.split('\n')
for i in range(len(matrix)):
matrix[i] = [a if a=="M" else 0 for a in matrix[i]]
def modify(x,y):
if x<0 or y<0:
return
try:
matrix[x][y] += 1
except:
pass
for x in range(10):
for y in range(10):
if matrix[x][y]=='M':
modify(x-1,y-1)
modify(x-1,y)
modify(x-1,y+1)
modify(x,y-1)
modify(x,y+1)
modify(x+1,y-1)
modify(x+1,y)
modify(x+1,y+1)
for each in matrix:
print(*each)

复制代码

0 0 0 1 2 2 1 0 0 0
0 0 0 2 M M 1 0 0 0
0 0 0 3 M 5 2 0 0 0
0 1 1 3 M M 1 0 0 0
0 2 M 3 2 2 1 0 0 0
0 2 M 2 0 0 0 0 0 0
0 1 1 2 2 2 1 0 0 0
1 1 1 1 M M 2 1 0 0
2 M 1 1 2 3 M 1 0 0
M 2 1 0 0 1 1 1 0 0

xiaocy123 · 发表于 2018-2-5 12:34:06

天圆突破 · 发表于 2018-2-5 13:51:57

本帖最后由天圆突破于 2018-2-5 14:06 编辑

def mines(lst):
#打印小棋盘
for each1 in lst:
print('')
for each2 in each1:
print(' ' + each2 + ' ',end = '')
#分隔
print('\n'*3)
#扩大棋盘
for each in lst:
each.insert(0,'-')
each.append('-')
lst.insert(0,['-' for i in range(12)])
lst.append(['-' for i in range(12)])
#打印大棋盘
for each1 in lst:
print('')
for each2 in each1:
print(' ' + each2 + ' ',end = '')
#计算小棋盘
while True:
flag = 0
for i in range(1,11):
for j in range(1,11):
if lst[i][j] != '-':
pass
else:
temp = list()
for a in range(i-1,i+2):
for b in range(j-1,j+2):
temp.append(lst[a][b])
res = temp.count('M')
lst[i][j] = str(res)
flag += 1
if flag == 0:
break
#分隔
print('\n'*3)
# 还原棋盘
del lst[0]
del lst[10]
for each in lst:
del each[0]
del each[10]
#打印棋盘
for each1 in lst:
print('')
for each2 in each1:
print(' ' + each2 + ' ',end = '')
if __name__ == '__main__':
#生成棋盘
lst = [['-' for i in range(10)] for j in range(10)]
lst[1][4] = lst[1][5] = lst[2][4] = lst[3][4] = lst[3][5] = lst[4][2] = lst[5][2] = lst[7][4] = lst[7][5] = lst[8][1] = lst[8][6] = lst[9][0] = 'M'
#执行
mines(lst)

复制代码

AdaHao · 发表于 2018-2-5 13:54:58

不会啊

大头目 · 发表于 2018-2-5 15:37:21

def Check_count(out_leiquc):
for i in range(10):
for j in range(10):
if leiqu[i][j] != 9:
if i == 0 and j == 0:
out_leiquc[i][j] = leiqu[i][j+1] + leiqu[i+1][j] + leiqu[i+1][j+1]
out_leiquc[i][j] = out_leiqu[i][j]//9
elif i == 0 and j == 9:
out_leiquc[i][j] = leiqu[i][j-1] + leiqu[i+1][j-1] + leiqu[i+1][j]
out_leiquc[i][j] = out_leiqu[i][j]//9
elif i == 9 and j == 0:
out_leiquc[i][j] = leiqu[i-1][j] + leiqu[i-1][j+1] + leiqu[i][j+1]
out_leiquc[i][j] = out_leiqu[i][j]//9
elif i == 9 and j == 9:
out_leiquc[i][j] = leiqu[i-1][j-1] + leiqu[i-1][j] + leiqu[i][j-1]
out_leiquc[i][j] = out_leiqu[i][j]//9

elif i == 0 and j != 0 and j != 9:
out_leiquc[i][j] = leiqu[i][j-1] +                leiqu[i][j+1] +\
   leiqu[i+1][j-1] + leiqu[i+1][j] + leiqu[i+1][j+1]
#print(i,j,leiqu[i][j-1])检查错误，这里我把函数定义变量和全局变量名字写成一样了，小白坑了半小时
out_leiquc[i][j] = out_leiqu[i][j]//9
elif i == 9 and j != 0 and j != 9:
out_leiquc[i][j] = leiqu[i-1][j-1] + leiqu[i-1][j] + leiqu[i-1][j+1] +\
   leiqu[i][j-1] +                leiqu[i][j+1]
out_leiquc[i][j] = out_leiqu[i][j]//9
elif j == 0 and i != 0 and i != 9:
out_leiquc[i][j] = leiqu[i-1][j] + leiqu[i-1][j+1] +\
   leiqu[i][j+1] +\
   leiqu[i+1][j] + leiqu[i+1][j+1]
out_leiquc[i][j] = out_leiqu[i][j]//9
elif j == 9 and i != 0 and i != 9:
out_leiquc[i][j] = leiqu[i-1][j-1] + leiqu[i-1][j] +\
   leiqu[i][j-1] +\
   leiqu[i+1][j-1] + leiqu[i+1][j]
out_leiquc[i][j] = out_leiqu[i][j]//9

else:
out_leiquc[i][j] = leiqu[i-1][j-1] + leiqu[i-1][j] + leiqu[i-1][j+1] +\
   leiqu[i][j-1] +                leiqu[i][j+1] +\
   leiqu[i+1][j-1] + leiqu[i+1][j] + leiqu[i+1][j+1]
out_leiquc[i][j] = out_leiqu[i][j]//9

out_leiqu = [[0,0,0,0,0,0,0,0,0,0],
   [0,0,0,0,9,9,0,0,0,0],
   [0,0,0,0,9,0,0,0,0,0],
   [0,0,0,0,9,9,0,0,0,0],
   [0,0,9,0,0,0,0,0,0,0],
   [0,0,9,0,0,0,0,0,0,0],
   [0,0,0,0,0,0,0,0,0,0],
   [0,0,0,0,9,9,0,0,0,0],
   [0,9,0,0,0,0,9,0,0,0],
   [9,0,0,0,0,0,0,0,0,0]]

leiqu = [[0,0,0,0,0,0,0,0,0,0],
   [0,0,0,0,9,9,0,0,0,0],
   [0,0,0,0,9,0,0,0,0,0],
   [0,0,0,0,9,9,0,0,0,0],
   [0,0,9,0,0,0,0,0,0,0],
   [0,0,9,0,0,0,0,0,0,0],
   [0,0,0,0,0,0,0,0,0,0],
   [0,0,0,0,9,9,0,0,0,0],
   [0,9,0,0,0,0,9,0,0,0],
   [9,0,0,0,0,0,0,0,0,0]]

Check_count(out_leiqu)
#光把9转回M不直观，索性全部转换成字符串，看起来直观
for a in range(10):
for b in range(10):
if out_leiqu[a][b] == 9:
out_leiqu[a][b] = 'M'
else:
out_leiqu[a][b] = str(out_leiqu[a][b])
for i in range(10):
print(out_leiqu[i])

yjsx86 · 发表于 2018-2-5 15:41:17

本帖最后由 yjsx86 于 2018-2-6 09:54 编辑

import random
def mineGame(co_x,co_y,amount=10):
'co_x*co_y初始地图大小 amount初始地雷数量'
# 生成地雷坐标
mines = []
while len(mines) < amount:
mine = (random.randrange(co_x),random.randrange(co_y))
if mine not in mines:
mines.append(mine)
# 根据mines生成地图
mineMap = [['M' if (i,j) in mines else 0 for j in range(co_x)] for i in range(co_y)]
# 把地雷周围的数字 += 1
for y,x in mines:
for mo_y in range(0 if y-1<0 else y-1,10 if y+2>10 else y+2):
for mo_x in range(0 if x-1<0 else x-1,10 if x+2>10 else x+2):
if (mo_y,mo_x) not in mines:
mineMap[mo_y][mo_x] += 1
print(mines)
return mineMap
for x in mineGame(10,10):
print(' '.join(map(str,x)))
# result
1 M 1 0 0 0 1 M 2 1
1 1 2 1 1 0 2 2 3 M
0 0 1 M 1 0 1 M 2 1
1 1 1 1 1 0 1 1 1 0
M 2 1 0 0 0 0 0 0 0
2 M 1 0 0 0 0 0 1 1
1 1 1 0 0 0 1 2 3 M
0 0 0 0 0 0 1 M M 2
0 0 0 0 0 0 1 2 2 1
0 0 0 0 0 0 0 0 0 0

复制代码

塔利班 · 发表于 2018-2-5 16:41:43

def Num(l):
#l为10*10的列表,有雷的位置元素为'M',L为12*12的列表
L=[[0]*12]*12
for i in range(12):
if 1<=i<=10:
L[i]=[0]+l[i-1]+[0]
for i in range(1,11):
for j in range(1,11):
if L[i][j]!='M':
for k in range(-1,2):
L[i][j] += L[i+k][j-1:j+2].count('M')
l[i-1][j-1]=L[i][j]
for each in l:
print(each)
l=[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,'M','M',0,0,0,0],[0,0,0,0,'M',0,0,0,0,0],[0,0,0,0,'M','M',0,0,0,0],[0,0,'M',0,0,0,0,0,0,0],[0,0,'M',0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,'M','M',0,0,0,0],[0,'M',0,0,0,0,'M',0,0,0],['M',0,0,0,0,0,0,0,0,0]]
Num(l)

复制代码

lihw · 发表于 2018-2-5 17:46:02

list1=([0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,'m','m',0,0,0,0],
[0,0,0,0,'m',0,0,0,0,0],
[0,0,0,0,'m','m',0,0,0,0],
[0,0,'m',0,0,0,0,0,0,0],
[0,0,'m',0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,'m','m',0,0,0,0],
[0,'m',0,0,0,0,'m',0,0,0],
['m',0,0,0,0,0,0,0,0,0])
for i in range (10):
for j in range(10):
if i <9:
if list1[i][j]=='m':
if list1[i-1][j-1]!='m':
list1[i-1][j-1]=list1[i-1][j-1]+1
if list1[i-1][j]!='m':
list1[i-1][j]+=1
if list1[i-1][j+1]!='m':
list1[i-1][j+1]+=1
if list1[i][j-1]!='m':
list1[i][j-1]+=1
if list1[i][j+1]!='m':
list1[i][j+1]+=1
if list1[i+1][j-1]!='m':
list1[i+1][j-1]+=1
if list1[i+1][j]!='m':
list1[i+1][j]+=1
if list1[i+1][j+1]!='m':
list1[i+1][j+1]+=1
if i ==9:
if list1[i][j]=='m':
if list1[i-1][j-1]!='m':
list1[i-1][j-1]+=1
if list1[i-1][j]!='m':
list1[i-1][j]+=1
if list1[i-1][j+1]!='m':
list1[i-1][j+1]+=1
if list1[i][j-1]!='m':
list1[i][j-1]+=1
if list1[i][j+1]!='m':
list1[i][j+1]+=1
for t in list1:
print(t)

复制代码

solomonxian · 发表于 2018-2-5 20:37:08

告诉我地雷的位置，那我假设输入是坐标索引吧
想不到巧妙的法子，
直接在全是0的二维列表里面放地雷得了

每个地雷周围8格+1

def fun(positions, shape=(10, 10)):
matrix = [[0 for i in range(shape[1])] for j in range(shape[0])]
around = lambda x,y: ((i, j) for i in range(x-1, x+2)
for j in range(y-1, y+2))
for pos in positions:
matrix[pos[0]][pos[1]] = 'M'
for x, y in around(*pos):
if shape[0] > x >= 0 and shape[1] > y >= 0:
try:
matrix[x][y] += 1
except TypeError:
continue
return matrix
m = [(1,4), (1,5), (2,4), (3,4), (3,5), (4,2),
(5,2), (7,4), (7,5), (8,1), (8,6), (9,0)]
if __name__ == "__main__":
[print(*i) for i in fun(m)]
##0 0 0 1 2 2 1 0 0 0
##0 0 0 2 M M 1 0 0 0
##0 0 0 3 M 5 2 0 0 0
##0 1 1 3 M M 1 0 0 0
##0 2 M 3 2 2 1 0 0 0
##0 2 M 2 0 0 0 0 0 0
##0 1 1 2 2 2 1 0 0 0
##1 1 1 1 M M 2 1 0 0
##2 M 1 1 2 3 M 1 0 0
##M 2 1 0 0 1 1 1 0 0

复制代码

ouyunfu · 发表于 2018-2-6 02:47:34

#-*- coding:utf-8 -*-
myList = [([0] * 10) for i in range(10)]

myList[1][4],myList[1][5],myList[2][4],myList[3][4],myList[3][5],myList[4][2],myList[5][2],myList[7][4],myList[7][5],myList[8][1],myList[8][6],myList[9][0]='M'*12
for i in range(10):
for j in range(10):
      if myList[i][j]!='M':
         pass
      elif i==9 and j==0:
         if myList[i - 1][0] != 'M':
            myList[i-1][j]+=1
         if myList[i-1][j+1]!='M':
            myList[i-1][j+1]+=1
         if myList[i][j + 1] != 'M':
            myList[i][j+1]+=1
      else:
         if myList[i - 1][j - 1] != 'M':
            myList[i - 1][j-1]+=1
         if myList[i - 1][j] != 'M':
            myList[i - 1][j]+=1
         if myList[i - 1][j + 1] != 'M':
            myList[i - 1][j+1]+=1
         if myList[i][j - 1] != 'M':
            myList[i][j-1]+=1
         if myList[i][j + 1] != 'M':
            myList[i][j+1]+=1
         if myList[i + 1][j - 1] != 'M':
            myList[i+1][j-1]+=1
         if myList[i + 1][j] != 'M':
            myList[i + 1][j]+=1
         if myList[i + 1][j + 1] != 'M':
            myList[i + 1][j+1]+=1

for i in range(10):
print(myList[i])

wyp02033 · 发表于 2018-2-7 00:11:50

def main():
minefield = [
['', '', '', '', '', '', '', '', '', ''],
['', '', '', '', 'M', 'M', '', '', '', ''],
['', '', '', '', 'M', '', '', '', '', ''],
['', '', '', '', 'M', 'M', '', '', '', ''],
['', '', 'M', '', '', '', '', '', '', ''],
['', '', 'M', '', '', '', '', '', '', ''],
['', '', '', '', '', '', '', '', '', ''],
['', '', '', '', 'M', 'M', '', '', '', ''],
['', 'M', '', '', '', '', 'M', '', '', ''],
['M', '', '', '', '', '', '', '', '', '']
]
for i in range(10):
for j in range(10):
if not minefield[i][j]:
count = 0
for k in range(max(i-1, 0), min(i+2, 10)):
for l in range(max(j-1, 0), min(j+2, 10)):
if minefield[k][l] == 'M':
count += 1
minefield[i][j] = count
for i in range(10):
for j in range(10):
if j < 9:
print(minefield[i][j], end=' ')
else:
print(minefield[i][j])
if __name__ == '__main__':
main()

复制代码

运行结果
0 0 0 1 2 2 1 0 0 0
0 0 0 2 M M 1 0 0 0
0 0 0 3 M 5 2 0 0 0
0 1 1 3 M M 1 0 0 0
0 2 M 3 2 2 1 0 0 0
0 2 M 2 0 0 0 0 0 0
0 1 1 2 2 2 1 0 0 0
1 1 1 1 M M 2 1 0 0
2 M 1 1 2 3 M 1 0 0
M 2 1 0 0 1 1 1 0 0

cruise2018 · 发表于 2018-2-7 08:00:57

角落的m怎么处理呢

皮皮小发 · 发表于 2018-2-7 09:08:17

学习学习

graceasyi · 发表于 2018-2-8 11:25:49

写得有些复杂，等着看高手的答案~

M = 'M' # 为了好看……
l1 = [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, M, M, 0, 0, 0, 0],
[0, 0, 0, 0, M, 0, 0, 0, 0, 0],
[0, 0, 0, 0, M, M, 0, 0, 0, 0],
[0, 0, M, 0, 0, 0, 0, 0, 0, 0],
[0, 0, M, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, M, M, 0, 0, 0, 0],
[0, M, 0, 0, 0, 0, M, 0, 0, 0],
[M, 0, 0, 0, 0, 0, 0, 0, 0, 0]]
r = range(10) # 已知雷场是10*10
for i in r:
for j in r:
if l1[i][j] == M:
if (i-1) in r and (j-1) in r and l1[i-1][j-1] != M:
l1[i-1][j-1] += 1
if (i-1) in r and l1[i-1][j] != M:
l1[i-1][j] += 1
if (i-1) in r and (j+1) in r and l1[i-1][j+1] != M:
l1[i-1][j+1] += 1
if (j-1) in r and l1[i][j-1] != M:
l1[i][j-1] += 1
if (j+1) in r and l1[i][j+1] != M:
l1[i][j+1] += 1
if (i+1) in r and (j-1) in r and l1[i+1][j-1] != M:
l1[i+1][j-1] += 1
if (i+1) in r and l1[i+1][j] != M:
l1[i+1][j] += 1
if (i+1) in r and (j+1) in r and l1[i+1][j+1] != M:
l1[i+1][j+1] += 1
for i in r:
for j in r:
print(l1[i][j], end=' ')
print('\n')

复制代码

结果：

0    0    0    1    2    2    1    0    0    0

0    0    0    2    M    M    1    0    0    0

0    0    0    3    M    5    2    0    0    0

0    1    1    3    M    M    1    0    0    0

0    2    M    3    2    2    1    0    0    0

0    2    M    2    0    0    0    0    0    0

0    1    1    2    2    2    1    0    0    0

1    1    1    1    M    M    2    1    0    0

2    M    1    1    2    3    M    1    0    0

M    2    1    0    0    1    1    1    0    0

大头目 · 发表于 2018-2-9 08:15:04

塔利班发表于 2018-2-5 16:41

大佬代码写的漂亮啊！学习了！

被翻红浪 · 发表于 2018-2-9 09:07:14

n = 10
board = [[0 for i in range(n)] for j in range(n)]
board[1][4] = "M"
board[1][5] = "M"
board[2][4] = "M"
board[3][4] = "M"
board[3][5] = "M"
board[4][2] = "M"
board[5][2] = "M"
board[7][4] = "M"
board[7][5] = "M"
board[8][1] = "M"
board[8][6] = "M"
board[9][0] = "M"
for row in range(n):
for col in range(n):
count = 0
if board[row][col] == "M":
continue
# Upper-left corner
elif row == 0 and col == 0:
if board[row][col+1] == "M":
count += 1
if board[row+1][col] == "M":
count += 1
if board[row+1][col+1] == "M":
count += 1
board[row][col] = count
# Bottom-left corner
elif row == n-1 and col == 0:
if board[row][col+1] == "M":
count += 1
if board[row-1][col] == "M":
count += 1
if board[row-1][col+1] == "M":
count += 1
board[row][col] = count
# Upper-right corner
elif row == 0 and col == n-1:
if board[row][col-1] == "M":
count += 1
if board[row+1][col] == "M":
count += 1
if board[row+1][col-1] == "M":
count += 1
board[row][col] = count
# Bottom-right corner
elif row == n-1 and col == n-1:
if board[row][col-1] == "M":
count += 1
if board[row-1][col] == "M":
count += 1
if board[row-1][col-1] == "M":
count += 1
board[row][col] = count
# Top
elif row == 0:
if board[row+1][col-1] == "M":
count += 1
if board[row+1][col] == "M":
count += 1
if board[row+1][col+1] == "M":
count += 1
if board[row][col-1] == "M":
count += 1
if board[row][col+1] == "M":
count += 1
board[row][col] = count
# Bottom
elif row == n-1:
if board[row-1][col-1] == "M":
count += 1
if board[row-1][col] == "M":
count += 1
if board[row-1][col+1] == "M":
count += 1
if board[row][col-1] == "M":
count += 1
if board[row][col+1] == "M":
count += 1
board[row][col] = count
# Left
elif col == 0:
if board[row-1][col+1] == "M":
count += 1
if board[row][col+1] == "M":
count += 1
if board[row+1][col+1] == "M":
count += 1
if board[row-1][col] == "M":
count += 1
if board[row+1][col] == "M":
count += 1
board[row][col] = count
# Right
elif col == n-1:
if board[row-1][col-1] == "M":
count += 1
if board[row][col-1] == "M":
count += 1
if board[row+1][col-1] == "M":
count += 1
if board[row-1][col] == "M":
count += 1
if board[row+1][col] == "M":
count += 1
board[row][col] = count
else:
if board[row-1][col-1] == "M":
count += 1
if board[row-1][col] == "M":
count += 1
if board[row-1][col+1] == "M":
count += 1
if board[row][col-1] == "M":
count += 1
if board[row][col+1] == "M":
count += 1
if board[row+1][col-1] == "M":
count += 1
if board[row+1][col] == "M":
count += 1
if board[row+1][col+1] == "M":
count += 1
board[row][col] = count
for each in board:
print(*each)

复制代码

冰封雪舞 · 发表于 2018-2-9 15:20:44

塔利班发表于 2018-2-5 16:41

def Num(l):
#l为10*10的列表,有雷的位置元素为'M',L为12*12的列表
L=[[0]*12]*12
for i in range(12):
      if 1<=i<=10:
         L=[0]+l[i-1]+[0]
for i in range(1,11):
      for j in range(1,11):
         if L[j]!='M':
            for k in range(-1,2):
                  L[j] += L[i+k][j-1:j+2].count('M')
                  l[i-1][j-1]=L[j]
for each in l:
      for i in each:
         print(i,end ='')
      print(end='\n')
      #print(each)
l=[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,'M','M',0,0,0,0],[0,0,0,0,'M',0,0,0,0,0],[0,0,0,0,'M','M',0,0,0,0],[0,0,'M',0,0,0,0,0,0,0],[0,0,'M',0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,'M','M',0,0,0,0],[0,'M',0,0,0,0,'M',0,0,0],['M',0,0,0,0,0,0,0,0,0]]
Num(l)
喜欢你的程序，在你的程序基础上稍作修改美观点。

塔利班 · 发表于 2018-2-9 15:35:18

大头目发表于 2018-2-9 08:15
大佬代码写的漂亮啊！学习了！

谢谢，我视频都没看到一半，也是新手，慢慢学习中，经常来学习真好，马上过年回家了，不能总上论坛了，
把书和视频拿回去看看~

塔利班 · 发表于 2018-2-9 15:37:09

冰封雪舞发表于 2018-2-9 15:20
def Num(l):
#l为10*10的列表,有雷的位置元素为'M',L为12*12的列表
L=[[0]*12]*12

刚好有思路回避边角而已，还是新手，经常和大家来学习才是硬道理

账号		自动登录	找回密码
密码			立即注册

[技术交流] Python：每日一题 148

马上注册，结交更多好友，享用更多功能^_^

本帖被以下淘专辑推荐:

评分

评分

评分

评分

评分

评分

评分

评分

评分

评分