<p>Given an <code>m x n</code> <code>matrix</code>, return <em>all elements of the</em> <code>matrix</code> <em>in spiral order</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/spiral1.jpg" style="width: 242px; height: 242px;" />
<pre>
<strong>Input:</strong> matrix = [[1,2,3],[4,5,6],[7,8,9]]
<strong>Output:</strong> [1,2,3,6,9,8,7,4,5]
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/spiral.jpg" style="width: 322px; height: 242px;" />
<pre>
<strong>Input:</strong> matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
<strong>Output:</strong> [1,2,3,4,8,12,11,10,9,5,6,7]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>m == matrix.length</code></li>
	<li><code>n == matrix[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 10</code></li>
	<li><code>-100 &lt;= matrix[i][j] &lt;= 100</code></li>
</ul>

class Solution:
    def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
        m = len(matrix)
        n = len(matrix[0])

        result = []
        i,j = 0,0
        direction = 0 # 0:right, 1:down, 2:left, 3:up
        right_bound = n - 1
        down_bound = m-1
        left_bound = 0
        up_bound = 1

        for _ in range(m*n):
            result.append(matrix[i][j])

            if direction == 0:
                if j == right_bound:
                    direction = 1
                    i+=1
                    right_bound -= 1
                else:
                    j+=1
            elif direction == 1:
                if i == down_bound:
                    direction = 2
                    j-=1
                    down_bound -= 1
                else:
                    i+=1
            elif direction == 2:
                if j == left_bound:
                    direction = 3
                    i-=1
                    left_bound += 1
                else:
                    j-=1
            elif direction == 3:
                if i == up_bound:
                    direction = 0
                    j+=1
                    up_bound += 1
                else:
                    i-=1
        return result


        
16000