Spiral Matrix

 

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)
Sample Input 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 
import java.util.Scanner;

public class SpiralMatrix {

	public static void main(String[] args) {
	
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		int m = s.nextInt();
		int input[][] = new int[n][m];
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < m; j++)
			{
			input[i][j] = s.nextInt();
		}

	}
		spiralPrint(input);

}
	public static void spiralPrint(int matrix[][]){

		int rs= 0;
		int cs= 0;
		int re= matrix.length-1;
		int ce= matrix[0].length-1;
		int total = matrix.length * matrix.length;
		int c= 0;
		
		while(c<total)
		{
			for(int i=cs;i<=ce;i++)
			{
				System.out.print(matrix[rs][i]+ " ");
				c++;
			}
			rs++;
			for(int i=rs;i<=re;i++)
			{
				System.out.print(matrix[i][ce]+ " ");
				c++;
				
			}
			ce--;
			for(int i=ce;i>=cs;i--)
			{
				System.out.print(matrix[re][i]+ " ");
				c++;
			}
			re--;
			for(int i=re;i>=rs;i--)
			{
				System.out.print(matrix[i][cs]+ " ");
				c++;
			}
			cs++;
		}
	}

}

Comments

Post a Comment

Popular posts from this blog

Minimum Length Word

  Given a string S (that can contain multiple words), you need to find the word which has minimum length. Sample Input 1 : this is test string Sample Output 1 : is public class Solution { public static String minLengthWord(String input){ String[] arr=input.split(" "); int i=0; int minlength; minlength=Integer.MAX_VALUE; String smallest; smallest = ""; for(i=0;i<arr.length;i++) { if(arr[i].length() < minlength) { smallest=arr[i]; minlength=arr[i].length(); } } return smallest; } }
Read more

Check Number Sequence

  You are given S, a sequence of n integers i.e. S = s1, s2, ..., sn. Compute if it is possible to split S into two parts : s1, s2, ..., si and si+1, si+2, ….., sn (0 <= i <= n) in such a way that the first part is strictly decreasing while the second is strictly increasing one. Note : We say that x is strictly larger than y when x > y. So, a strictly increasing sequence can be 1 4 8. However, 1 4 4 is NOT a strictly increasing sequence. That is, in the sequence if numbers are decreasing, they can start increasing at one point. And once the sequence of numbers starts increasing, they cannot decrease at any point further. Sequence made up of only increasing numbers or only decreasing numbers is a valid sequence. So, in both the cases, print true. You just need to print true/false. No need to split the sequence. Sample Input 1 : 5 9 8 4 5 6 Sample Output 1 : true import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner s = new Scanner (Sys
Read more

Star Pattern

Image
  Pattern for N = 4 import java.util.Scanner; public class StarPattern { public static void main(String[] args) { Scanner s = new Scanner(System.in); int n= s.nextInt(); for(int i=1;i<=n;i++) { for(int j=1;j<=n-i;j++) { System.out.print(" "); } for(int k=1;k<=2*i-1;k++) { System.out.print("*"); } System.out.println(); } } }
Read more