mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-08-01 18:49:39 +08:00
63 lines
1.7 KiB
Java
63 lines
1.7 KiB
Java
package com.thealgorithms.others;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.List;
|
|
|
|
public class PrintAMatrixInSpiralOrder {
|
|
/**
|
|
* Search a key in row and column wise sorted matrix
|
|
*
|
|
* @param matrix matrix to be searched
|
|
* @param row number of rows matrix has
|
|
* @param col number of columns matrix has
|
|
* @author Sadiul Hakim : https://github.com/sadiul-hakim
|
|
*/
|
|
|
|
public List<Integer> print(int[][] matrix, int row, int col) {
|
|
|
|
// r traverses matrix row wise from first
|
|
int r = 0;
|
|
// c traverses matrix column wise from first
|
|
int c = 0;
|
|
int i;
|
|
|
|
List<Integer> result = new ArrayList<>();
|
|
|
|
while (r < row && c < col) {
|
|
// print first row of matrix
|
|
for (i = c; i < col; i++) {
|
|
result.add(matrix[r][i]);
|
|
}
|
|
|
|
// increase r by one because first row printed
|
|
r++;
|
|
|
|
// print last column
|
|
for (i = r; i < row; i++) {
|
|
result.add(matrix[i][col - 1]);
|
|
}
|
|
|
|
// decrease col by one because last column has been printed
|
|
col--;
|
|
|
|
// print rows from last except printed elements
|
|
if (r < row) {
|
|
for (i = col - 1; i >= c; i--) {
|
|
result.add(matrix[row - 1][i]);
|
|
}
|
|
|
|
row--;
|
|
}
|
|
|
|
// print columns from first except printed elements
|
|
if (c < col) {
|
|
for (i = row - 1; i >= r; i--) {
|
|
result.add(matrix[i][c]);
|
|
}
|
|
c++;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
}
|