浙大Python 第4章-23 求矩阵的局部极大值 (15 分)

原题题目

---

---

代码实现

rows,lines = map(int,input().split())
grid = [[] for i in range(rows)]
for i in range(rows):
    line = list(input().split())
    for j in range(lines):
        grid[i].append(int(line[j]))
flag = 0
for i in range(rows):
    if(i!=0 and i!=rows-1):
        for j in range(lines):
            if(j!=0 and j!=lines-1):
                if(grid[i][j] > max(grid[i-1][j],grid[i+1][j],grid[i][j-1],grid[i][j+1])):print("%d %d %d" %(grid[i][j],i+1,j+1 ));flag = 1
if(flag == 0):print("None %d %d" %(rows,lines))

---

---

提交结果