2896: 二维数组右上左下遍历

解题思路:

注意事项:

参考代码:

n,m = map(int,input().split())

l = [list(map(int,input().strip().split())) for i in range(n)]

for i in range(m):

    j = 0

    while 0 <= j < n and 0 <= i <= m:

        print(l[j][i])

        j += 1

        i -= 1

for i in range(1,n):

    j = m-1

    while 0 <= j < m and 0 <= i < n:

        print(l[i][j])

        j -= 1

        i += 1