GFG-Problem-Solved/Boundary Traversal of Matrix at main · nidhiupman568/GFG-Problem-Solved · 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

class Solution
{
   public:
    vector<int> boundaryTraversal(vector<vector<int> > matrix, int n, int m)
    {
        vector<int>ans;

        for(int i=0; i<1; i++)
        {
            for(int j=0; j<m; j++)
            {
                ans.push_back(matrix[i][j]);
            }
        }
        for(int i=m-1; i<m; i++)
        {
            for(int j=1; j<n; j++)
            {
                ans.push_back(matrix[j][i]);
            }
        }

        if(n == 1)
            return ans;

        for(int i=n-1;i<n;i++)
        {
            for(int j=m-2; j>=0; j--)
            {
                ans.push_back(matrix[i][j]);
            }
        }

        if(m == 1)
            return ans;

        for(int i=n-2; i>=1; i--)
        {
            for(int j=0; j<1; j++)
            {
                ans.push_back(matrix[i][j]);
            }
        }
        return ans;
    }


};