practicalCode/printMatrix.cpp at master · dkl78167816/practicalCode · GitHub

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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;

// void PrintOneCircle(vector<vector<int>> matrix, int rows, int cols, int start, vector<int>& v)
// {
// 	if (matrix.empty())
// 		return;

// 	int endX = cols - 1 - start;//列
// 	int endY = rows - 1 - start;//行

// 	//从左往右打印
// 	for (int i = start; i <= endX; i++)
// 	{
// 		v.push_back(matrix[start][i]);
// 	}
// 	//从上到下打印
// 	if (start<endY)
// 	for (int i = start + 1; i <= endY; i++)
// 	{
// 		v.push_back(matrix[i][endX]);
// 	}
// 	//从右往左打印
// 	if (start<endX&&start<endY)
// 	for (int i = endX-1; i >= start; i--)
// 	{
// 		v.push_back(matrix[endY][i]);
// 	}
// 	//从下到上打印
// 	if (start<endX&&start<endY - 1)
// 	for (int i = endY - 1; i >= start + 1; i--)
// 	{
// 		v.push_back(matrix[i][start]);
// 	}
// }
// vector<int> printMatrix(vector<vector<int> > matrix)
// {
// 	vector<int> v;
// 	if (matrix.size() == 0)
// 		return v;

// 	int rows = matrix.size();
// 	int cols = matrix[0].size();

// 	int start = 0;
// 	while (rows>2 * start&&cols>2 * start)
// 	{
// 		PrintOneCircle(matrix, rows, cols, start, v);
// 		start++;
// 	}

// 	return v;
// }
void print_one_circle(vector<vector<int>>& m, int rows, int cols, int start, vector<int>& ret){
    if (m.size() == 0)
        return;
    int endr = rows - 1 - start;
    int endc = cols - 1 - start;

    //go right
    for (int i = start; i <= endc; i++){
        ret.push_back(m[start][i]);
    }
    //go down
    for (int i = start + 1; i <= endr; i++){
        ret.push_back(m[i][endc]);
    }

    if (endr > start)
        for (int i = endc - 1; i >= start; i--){
            ret.push_back(m[endr][i]);
        }

    if (endc > start)
        for (int i = endr - 1; i > start; i--){
            ret.push_back(m[i][start]);
        }
}

vector<int> printMatrix(vector<vector<int>>& m){
    vector<int> v;
    if (m.size() == 0)
        return v;

    int rows = m.size();
    int cols = m[0].size();
    int start = 0;
    while (start * 2 < rows && start * 2 < cols){
        print_one_circle(m, rows, cols, start, v);
        start ++;
    }
    return v;
}

int main(){
    vector<vector<int>> test = {{1, 2, 3}, {5, 6, 7}, {9, 10, 11}};
    for (auto i:printMatrix(test))
        cout << i << ' ';
    return 0;
}