题目描述
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字,例如,如果输入如下矩阵: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 则依次打印出数字1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10.
题目解释
class Solution {
public:
vector<int> printMatrix(vector<vector<int> > matrix) {
int row = matrix.size();
int col = matrix[0].size();
vector<int> res;
// 输入的二维数组非法,返回空的数组
if (row == 0 || col == 0) return res;
// 定义四个关键变量,表示左上和右下的打印范围
int left = 0, top = 0, right = col - 1, bottom = row - 1;
while (left <= right && top <= bottom)
{
// 从左到右
for (int i = left; i <= right; ++i) res.push_back(matrix[top][i]);
// 从上到下
for (int i = top + 1; i <= bottom; ++i) res.push_back(matrix[i][right]);
// 从右到左
if (top != bottom)//判断不是最后一层
for (int i = right - 1; i >= left; --i) res.push_back(matrix[bottom][i]);
// 从下往上
if (left != right)//判断不是最后一层
for (int i = bottom - 1; i > top; --i) res.push_back(matrix[i][left]);
left++,top++,right--,bottom--;//向内缩小一圈
}
return res;
}
};
链接:https://www.nowcoder.com/questionTerminal/9b4c81a02cd34f76be2659fa0d54342a