转载请注明出处:
https://blog.csdn.net/weixin_43141320/article/details/105500344
我的思路是利用递归实现,每一次传入未填充部分的左上角和右上角的坐标以及目前所到达的填充数值,即每一层递归仅填充最外层的部分,然后将内部传进去,上代码:
import numpy as np
in1 = input('输入矩阵形状m行n列,并用空格隔开:')
in1 = in1.split(' ')
r, c = int(in1[0]), int(in1[1])
in2 = input('输入要检索的元素的索引,并用空格隔开:')
in2 = in2.split(' ')
index_i, index_j = int(in2[0]), int(in2[1])
index_i -= 1
index_j -= 1
a=np.array([[0]*c]*r)
def fun(start_row, start_column, end_row, end_column, n): # 递归填充
if end_row-start_row+1<=0 or end_column-start_column+1<=0:
return
for i in range(start_row, end_row+1):
if i==start_row:
for j in range(start_column, end_column+1): # 填充第一行
a[i][j]=n
n+=1
#print(a)
elif i==end_row:
for j in range(end_column, start_column - 1,-1): # 填充最后一行
a[i][j]=n
n+=1
#print(a)
else:
a[i][end_column]=n # 填充最后一列
n+=1
for i in range(end_row-1, start_row, -1): # 填充第一列
a[i][start_column]=n
n+=1
#print(a)
fun(start_row+1,start_column+1,end_row-1, end_column-1, n)
fun(0, 0, r-1, c-1, 1)
print(a)
print(a[index_i][index_j])
测试一下:
一开始很痛苦,因为我使用a = [[None]*c]*r这个来初始化二维列表,这是大错特错,因为列表中的子表一个改变的时候其他的都会改变:
>>> a = [[0]*c]*r
>>> a
[[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]]
>>> a[0][0]=1
>>> a
[[1, 0, 0, 0, 0], [1, 0, 0, 0, 0], [1, 0, 0, 0, 0], [1, 0, 0, 0, 0]]
>>>
但是将a转换成ndarray类型之后是不会出现这种问题的,就如同上面的代码一样,如果不使用numpy,那么要循环创建:
in1 = input('输入矩阵形状m行n列,并用空格隔开:')
in1 = in1.split(' ')
r, c = int(in1[0]), int(in1[1])
in2 = input('输入要检索的元素的索引,并用空格隔开:')
in2 = in2.split(' ')
index_i, index_j = int(in2[0]), int(in2[1])
index_i -= 1
index_j -= 1
#a = [[None]*c]*r
#print(a)
#a=np.array([[0]*c]*r)
a=[]
for i in range(r):
a.append([])
for j in range(c):
a[i].append(0)
def fun(start_row, start_column, end_row, end_column, n): # 递归填充
if end_row-start_row+1<=0 or end_column-start_column+1<=0:
return
for i in range(start_row, end_row+1):
if i==start_row:
for j in range(start_column, end_column+1): # 填充第一行
a[i][j]=n
n+=1
#print(a)
elif i==end_row:
for j in range(end_column, start_column - 1,-1): # 填充最后一行
a[i][j]=n
n+=1
#print(a)
else:
a[i][end_column]=n # 填充最后一列
n+=1
for i in range(end_row-1, start_row, -1): # 填充第一列
a[i][start_column]=n
n+=1
#print(a)
fun(start_row+1,start_column+1,end_row-1, end_column-1, n)
fun(0, 0, r-1, c-1, 1)
print(a)
print(a[index_i][index_j])
测试:
输入矩阵形状m行n列,并用空格隔开:4 5
输入要检索的元素的索引,并用空格隔开:2 2
[[1, 2, 3, 4, 5], [14, 15, 16, 17, 6], [13, 20, 19, 18, 7], [12, 11, 10, 9, 8]]
15