剑指Offer(十九):顺时针打印矩阵
题目
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字,例如,如果输入如下矩阵:
则依次打印出数组:1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10。
解题思路
将结果存入vector数组,从左到右,再从上到下,再从右到左,最后从下到上遍历。
- C++
class Solution {
public:
vector<int> printMatrix(vector<vector<int> > matrix) {
int rows = matrix.size();
int cols = matrix[0].size();
vector<int> result;
int left = 0,right = cols - 1,top = 0,bottom = rows - 1;
while(left <= right && top <= bottom){
//从左到右
for(int i = left;i <= right;i++){
result.push_back(matrix[top][i]);
}
//从上到下
for(int j = top + 1; j <= bottom; j++){
result.push_back(matrix[j][right]);
}
//从右到左
if(top != bottom){
for(int i = right - 1; i >= left; --i){
result.push_back(matrix[bottom][i]);
}
}
//从下到上
if(left != right){
for(int i = bottom - 1; i > top; --i){
result.push_back(matrix[i][left]);
}
}
left++, top++, right--, bottom--;
}
return result;
}
};
- Python
# -*- coding:utf-8 -*-
class Solution:
# matrix类型为二维列表,需要返回列表
def printMatrix(self, matrix):
# write code here
res = []
rows = len(matrix)
cols = len(matrix[0])
left,right,top,bottom = 0,cols - 1,0,rows - 1
while left<=right and top <= bottom:
for i in range(left,right+1):
res.append(matrix[top][i])
for j in range(top+1,bottom+1):
res.append(matrix[j][right])
if top != bottom:
for i in range(left,right)[::-1]:
res.append(matrix[bottom][i])
if left != right:
for i in range(top+1,bottom)[::-1]:
res.append(matrix[i][left])
left +=1
top += 1
right -=1
bottom -= 1
return res