package org.example;

import java.util.ArrayList;

import java.util.List;

public class SpiralOrder {

public List<Integer> spiralOrder(int[][] matrix) {

int m = matrix.length;

int n = matrix[0].length;

int left = 0, right = n - 1, top = 0, bottom = m - 1;

List<Integer> list = new ArrayList<>();

while (left <= right && top <= bottom) {

for (int j = left; j <= right; j++) {

list.add(matrix[top][j]);

}

top++;

for (int i = top; i <= bottom; i++) {

list.add(matrix[i][right]);

}

right--;

if (top <= bottom) {

for (int j = right; j >= left; j--) {

list.add(matrix[bottom][j]);

}

bottom--;

}

if (left <= right) {

for (int i = bottom; i >= top; i--) {

list.add(matrix[i][left]);

}

left++;

}

}

return list;

}

}