-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquestion29.cpp
More file actions
55 lines (47 loc) · 1.42 KB
/
Copy pathquestion29.cpp
File metadata and controls
55 lines (47 loc) · 1.42 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/*
输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字.
例如，如果输入如下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.
Xiaobin Tian;
*/
#include<vector>
using namespace::std;
class Solution {
vector<int> printMatrixCircle(vector<vector<int> > matrix, int start){
vector<int> result;
int endX = matrix[0].size() - start;
int endY = matrix.size() - start;
for(int i = start; i < endX; ++i)
result.push_back(matrix[start][i]);
if((endY - start) > 1){
for(int i = start+1; i < endY; ++i)
result.push_back(matrix[i][endX - 1]);
if(((endY - start) > 1) && (endX - start) > 1)
for(int i = endX-2; i >= start; --i)
result.push_back(matrix[endY-1][i]);
if(((endY - start) > 2) && (endX - start) > 1)
for(int i = endY-2; i > start; --i)
result.push_back(matrix[i][start]);
}
return result;
}
public:
vector<int> printMatrix(vector<vector<int> > matrix) {
vector<int> result;
if(matrix.size() == 0)
return result;
int start = 0;
while(matrix.size() > start*2 && matrix[0].size() > start*2){
auto list = printMatrixCircle(matrix, start);
++start;
for(int i = 0; i < list.size(); ++i){
result.push_back(list[i]);
}
}
return result;
}
};