forked from shivprime94/Data-Structure-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathspiralprint.cpp
More file actions
110 lines (84 loc) · 2.55 KB
/
spiralprint.cpp
File metadata and controls
110 lines (84 loc) · 2.55 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
109
110
/* Spiral Print
For a given two-dimensional integer array/list of size (N x M), print it in a spiral form. That is, you need to print in the order followed for every iteration:
a. First row(left to right)
b. Last column(top to bottom)
c. Last row(right to left)
d. First column(bottom to top)
Mind that every element will be printed only once.
Input format :
The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
First line of each test case or query contains two integer values, 'N' and 'M', separated by a single space. They represent the 'rows' and 'columns' respectively, for the two-dimensional array/list.
Second line onwards, the next 'N' lines or rows represent the ith row values.
Each of the ith row constitutes 'M' column values separated by a single space.
Output format :
For each test case, print the elements of the two-dimensional array/list in the spiral form in a single line, separated by a single space.
Output for every test case will be printed in a seperate line.
Constraints :
1 <= t <= 10^2
0 <= N <= 10^3
0 <= M <= 10^3
Time Limit: 1sec
Sample Input 1:
1
4 4
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
Sample Output 1:
1 2 3 4 8 12 16 15 14 13 9 5 6 7 11 10
*/
#include <iostream>
using namespace std;
void spiralPrint(int **input, int m, int n)
{
int i, k = 0, l = 0;
while (k < m && l < n) {
for (i = l; i < n; ++i) {
cout << input[k][i] << " ";
}
k++;
for (i = k; i < m; ++i) {
cout << input[i][n - 1] << " ";
}
n--;
if (k < m) {
for (i = n - 1; i >= l; --i) {
cout << input[m - 1][i] << " ";
}
m--;
}
if (l < n) {
for (i = m - 1; i >= k; --i) {
cout << input[i][l] << " ";
}
l++;
}
}
}
int main()
{
int t;
cin >> t;
while (t--)
{
int row, col;
cin >> row >> col;
int **matrix = new int *[row];
for (int i = 0; i < row; i++)
{
matrix[i] = new int[col];
for (int j = 0; j < col; j++)
{
cin >> matrix[i][j];
}
}
spiralPrint(matrix, row, col);
for (int i = 0; i < row; ++i)
{
delete[] matrix[i];
}
delete[] matrix;
cout << endl;
}
}