题目:
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字,例如,如果输入如下4 X 4矩阵: 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.
知识点:
- 利用vector构建二维数组时,vec.size()是行数;
注意:
- 注意打印的界限,从右往左、从下往上打印时判断是否重复
代码实现:
1.先确定需要循环多少圈才能实现全部遍历一遍
2.每圈打印(从左到右,上到下、右到左(重复否)、下到上(重复否))
/*顺时针打印矩阵*/
vector<int> printMatrix(vector<vector<int> > matrix) {
vector<int> res;
res.clear();
int rows = matrix.size();
int cols = matrix[0].size();
// 计算要循环几圈
int circles = ((rows < cols ? rows : cols) - 1) / 2 + 1;
//按圈数打印
for (int i = 0; i < circles; i++)
{
//从左向右打印
for (int j = i; j <= cols - i - 1; j++)
res.push_back(matrix[i][j]);
//从上向下
for (int k = i + 1; k <= rows - i - 1; k++)
res.push_back(matrix[k][cols-i-1]);
//从右到左(还要避免重复)
for (int m = cols - i - 2; (m >= i) && (rows - i - 1 != i); m--)
res.push_back(matrix[rows - i - 1][m]);
//从下到上(还要避免重复)
for (int n = rows - i - 2; (n >= i + 1) && (cols - i - 1 != i);n--)
res.push_back(matrix[n][i]);
}
return res;
}
}
int main()
{
vector< vector<int> > vec(4, vector<int>(4));
//赋值
int i, j;
int num = 1;
for (i = 0; i < vec.size(); i++)
{
for (j = 0; j < vec[i].size(); j++)
{
vec[i][j] = num++;
}
}
//打印
vector<int> res = printMatrix(vec);
vector<int>::iterator it;
for (it = res.begin(); it != res.end(); ++it)
cout << *it << " ";
getchar();
return 0;
}