Data-Structures/Spiral Matrix.cpp at master · Amisha-here/Data-Structures · 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
#include <bits/stdc++.h>
#include <vector>
using namespace std;

int main()
{   int n;
    cout << "enter n" << endl;   // taking input
    cin >> n;
    int a[n][n];
    for(int i=0;i<n;i++)

    {
        for(int j=0;j<n;j++)
        {
            cin >> a[i][j];    //
        }
    }
    cout << "entered matrix" << endl;
    for(int i=0;i<n;i++)

    {
        for(int j=0;j<n;j++)
        {
            cout << a[i][j] << " ";
        }
        cout << endl;
    }
    vector <int> v;
    int row = n;
    int col = n;
    int sr=0, sc=0, er=row-1 ,ec=col-1;


    int count=0;
    while(sr<=er && sc<=ec)
    {
        for(int i=sc;i<=ec;i++)
        {
            v.push_back(a[sr][i]);
            count++;
        }
        sr++;
        if(count==n*n)
        {
            break;
        }
        for(int i=sr;i<=er;i++)
        {
            v.push_back(a[i][ec]);
            count++;
        }
        ec--;
        if(count==n*n)
        {
            break;
        }
        for(int i=ec;i>=sc;i--)
        {
            v.push_back(a[er][i]);
            count++;
        }
        er--;
        if(count==n*n)
        {
            break;
        }
        for(int i=er;i>=sr;i--)
        {
            v.push_back(a[i][sc]);
            count++;
        }
        sc++;
        if(count==n*n)
        {
            break;
        }
    }

    for(int i = 0;i<row*col;i++)
    {
        cout << v.at(i) << " ";
    }


    return 0;
}
// Anjani