0009-编程打卡：指定矩阵对应位置求和

不二如是

一星答案：

X = [[12,7,3],[4,5,6],[7,8,9]]
Y = [[5,8,1],[6,7,3],[4,5,9]]
result = [[0,0,0],[0,0,0],[0,0,0]]
 
# 迭代输出行, lie
for i in range(len(X)):
   for j in range(len(X[0])):
       result[i][j] = X[i][j] + Y[i][j]

#输出结果
for r in result:
   print(r)

二星答案：

import numpy as np

x = np.array([[12, 7, 3], [4, 5, 6], [7, 8, 9]])
y = np.array([[5, 8, 1], [6, 7, 3], [4, 5, 9]])
print(x + y)

x = np.array([[12, 7, 3], [4, 5, 6], [7, 8, 9]])
y = np.array([[5, 8, 1], [6, 7, 3], [4, 5, 9]])
z = [i + j for i, j in zip(sum(x, []), sum (y, []))]
z = [z[0:3], z[3:6], z[6:9]]

三星答案：

游客，如果您要查看本帖隐藏内容请回复

基础语法：



算法讲解：

hrp

Python 好好玩

hveagle

Python[space]好好玩[space]0010呢？

叶墨沫

Python 好好玩

QWERTYUIO1P1

Python 好好玩