Showing posts with label Boundary Traversal of Matrix. Show all posts
Showing posts with label Boundary Traversal of Matrix. Show all posts

Wednesday, June 29, 2022

Boundary Traversal of Matrix

Boundary Traversal of Matrix

Problem Statement
You are given a matrix A of dimensions n x m. The task is to perform boundary traversal on the matrix in clockwise manner.










import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args) {
   Scanner sc = new Scanner(System.in);

        int t = sc.nextInt();

        

        while(t-- > 0)

        {

            int n1 = sc.nextInt();

            int m1 = sc.nextInt();

            

            int arr1[][] = new int[n1][m1];

            

            for(int i = 0; i < n1; i++)

            {

                for(int j = 0; j < m1; j++)

                 arr1[i][j] = sc.nextInt();

            }

            boundaryTraversal(n1, m1,arr1);

            System.out.println();

            

        }

    }



static void boundaryTraversal( int n1, int m1, int arr1[][])

    {

        // base cases

        if(n1 == 1)

        {

            int i = 0;

            while(i < m1)

            System.out.print(arr1[0][i++] + " ");

        }

        else if(m1 == 1)

        {

            int i = 0;

            while(i < n1)

            System.out.print(arr1[i++][0]+" ");

        }

        else

        {

            

            // traversing the first row

            for(int j=0;j<m1;j++)

            {

                System.out.print(arr1[0][j]+" ");

            }

            

            // traversing the last column

            for(int j=1;j<n1;j++)

            {

                System.out.print(arr1[j][m1-1]+ " ");

            }

            

            // traversing the last row

            for(int j=m1-2;j>=0;j--)

            {

                System.out.print(arr1[n1-1][j]+" ");

            }

            

            // traversing the first column

            for(int j=n1-2;j>=1;j--)

            {

               System.out.print(arr1[j][0]+" ");

            }

            

        } 

            

    }

}

ads vert

Basic HTML Tables - Layout, HTML Tables, Attributes, Aside, Footer, Tr tag, Td tag, Th tag, Tbody

  Basic HTML Tables - Layout, HTML Tables, Attributes, Aside, Footer, Tr tag, Td tag, Th tag, Tbody < table >      < thead >    ...