/*转圈打å°çŸ©é˜µï¼Œä¾‹å¦‚矩阵
1 2 打å°ç»“果为 1 2 4 3
3 4
分æžï¼šå¦‚æžœæŒ‰ç…§ä¸‹æ ‡å移æ¥æŽ§åˆ¶æ‰“å°çš„è¯å¤ªè¿‡éº»çƒ¦ï¼Œ
所以维护2个顶点åæ ‡ï¼Œæ¯æ¬¡å¤–围打å°ä¸€åœˆæ•°å—。
è¦æ±‚空间å¤æ‚度为O(1)
*/
#include
#include
#include
using namespace std;
// 打å°è¾¹ç¼˜ä¸€åœˆçš„函数
void printpEdge(vector> m, int row1, int clo1, int row2, int clo2)
{
if (row1 > row2 || clo1 > clo2){
cerr << " row or clo wrong" << endl;
return;
}
if (clo1 == clo2){
// åˆ—æ ‡ç›¸ç‰ è¯´æ˜Žåªæœ‰1列
for (int i = row1; i <= row2; i++){
cout << m[i][clo1] << " ";
}
}
else if (row1 == row2){
// è¡Œæ ‡ç›¸ç‰ è¯´æ˜Žåªæœ‰1è¡Œ
for (int i = clo1; i <= clo2; i++){
cout << m[row1][i] << " ";
}
}
else{
// 注æ„顶角4å…ƒç´ ä¸è¦é‡å¤æ‰“å°
// 从左到å³æ‰“å°ç¬¬row1è¡Œ
for (int i = clo1; i <= clo2; i++){
cout << m[row1][i] << " ";
}
// 从上到下打å°ç¬¬clo2列
for (int i = row1 + 1; i <= row2; i++){
cout << m[i][clo2] << " ";
}
// 从å³åˆ°å·¦æ‰“å°ç¬¬row2è¡Œ
for (int i = clo2-1; i >= clo1; i--){
cout << m[row2][i] << " ";
}
// 从下到上打å°ç¬¬clo1列
for (int i = row2 - 1; i >= row1 + 1; i--){
cout << m[i][clo1] << " ";
}
}
}
// 转圈打å°çŸ©é˜µ
void circleMatrix(vector> m)
{
if (m.empty()){
cerr << "martix is null";
return;
}
int row1 = 0;
int clo1 = 0;
int row2 = m.size() - 1;
int clo2 = m[0].size() - 1;
while (row1 <= row2 && clo1 <= clo2){
printpEdge(m, row1, clo1, row2, clo2);
row1++;
clo1++;
row2--;
clo2--;
}
}
int main(){
vector tmp;
vector> m;
for (int i = 1; i < 15; i++)
tmp.push_back(i);
for (int i = 0; i < 4; i++)
{
if (i%2==0)
m.push_back(tmp);
else{
reverse(tmp.begin(),tmp.end());
m.push_back(tmp);
}
}
cout << "matrix content is:" << endl;
for (int i = 0; i < m.size(); i++){
for (int j = 0; j < m[0].size(); j++){
cout << m[i][j] << " ";
}
cout << endl;
}
cout << endl << "circle print result:" << endl;
circleMatrix(m);
system("pause");
return 0;
}