-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtransform_matrix_to_array_spiral_form.cpp
More file actions
108 lines (91 loc) · 1.77 KB
/
transform_matrix_to_array_spiral_form.cpp
File metadata and controls
108 lines (91 loc) · 1.77 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
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
103
104
105
106
107
108
#include <iostream>
#include <vector>
#include <iterator>
using namespace std;
void print_matrix(vector<vector<int>> matrix)
{
vector<int> array;
int num_row, num_collum;
int k, z;
int i, j;
int data;
int count_index;
data = 0;
num_row = matrix.size() - 1;
num_collum = matrix[0].size() - 1;
k = z = 0;
while((k < num_row) && (z < num_collum))
{
for (i = z; i <= num_collum; i++)
{
data = matrix[0][i];
array.push_back(data);
}
i--;
k++;
for (j = k; j <= num_row; j++)
{
/* code */
data = matrix[j][i];
array.push_back(data);
}
j--;
num_collum--;
for (i = num_collum; i >= z; i--)
{
/* code */
data = matrix[j][i];
array.push_back(data);
}
i++;
num_row--;
for (j = num_row; j >= k; j--)
{
/* code */
data = matrix[j][i];
array.push_back(data);
}
j++;
z++;
}
count_index = array.size() - 1;
for ( i = 0; i < count_index; i++)
{
/* code */
std::cout << array[i] << " ";
}
cout << endl;
}
int main(int argc, char const *argv[]) {
vector<std::vector<int>> matrix;
int i, j, k;
int data;
matrix.resize(10);
k = 0;
while(1)
{
for ( i = 0; i < 10; i++)
{
// matrix[i].resize(10);
for ( j = 0; j < 100; j++)
{
/* code */
matrix[i].push_back(k);
k++;
}
}
break;
}
for ( i = 0; i < 10; i++)
{
for ( j = 0; j < 100; j++)
{
/* code */
data = matrix[i][j];
std::cout << data << " ";
}
cout << endl;
}
print_matrix(matrix);
return 0;
}