<p>You are given two integers <code>m</code> and <code>n</code>, which represent the dimensions of a matrix.</p>

<p>You are also given the <code>head</code> of a linked list of integers.</p>

<p>Generate an <code>m x n</code> matrix that contains the integers in the linked list presented in <strong>spiral</strong> order <strong>(clockwise)</strong>, starting from the <strong>top-left</strong> of the matrix. If there are remaining empty spaces, fill them with <code>-1</code>.</p>

<p>Return <em>the generated matrix</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2022/05/09/ex1new.jpg" style="width: 240px; height: 150px;" />
<pre>
<strong>Input:</strong> m = 3, n = 5, head = [3,0,2,6,8,1,7,9,4,2,5,5,0]
<strong>Output:</strong> [[3,0,2,6,8],[5,0,-1,-1,1],[5,2,4,9,7]]
<strong>Explanation:</strong> The diagram above shows how the values are printed in the matrix.
Note that the remaining spaces in the matrix are filled with -1.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2022/05/11/ex2.jpg" style="width: 221px; height: 60px;" />
<pre>
<strong>Input:</strong> m = 1, n = 4, head = [0,1,2]
<strong>Output:</strong> [[0,1,2,-1]]
<strong>Explanation:</strong> The diagram above shows how the values are printed from left to right in the matrix.
The last space in the matrix is set to -1.</pre>

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

<ul>
	<li><code>1 &lt;= m, n &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= m * n &lt;= 10<sup>5</sup></code></li>
	<li>The number of nodes in the list is in the range <code>[1, m * n]</code>.</li>
	<li><code>0 &lt;= Node.val &lt;= 1000</code></li>
</ul>

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    direction_offset = {
        0: (0, 1),   # right
        1: (1, 0),   # down
        2: (0, -1),  # left
        3: (-1, 0),  # up
    }
    direction = 0
    row, col = 0, -1

    def change_direction(self):
        self.direction = (self.direction + 1) % 4

    def get_direction_offset(self):
        return self.direction_offset[self.direction]

    def get_new_point(self):
        row_offset, col_offset = self.get_direction_offset()
        new_row, new_col = self.row + row_offset, self.col + col_offset
        return new_row, new_col

    def get_new_ll_val(self):
        result = -1
        if self.node:
            result = self.node.val
            self.node = self.node.next
        return result

    def spiralMatrix(
        self, m: int, n: int, head: Optional[ListNode]
    ) -> List[List[int]]:       
        grid = [[-1 for i in range(n)] for i in range(m)]
        self.node = head
        
        while self.node:
            new_row, new_col = self.get_new_point()
            if (
                new_row >= m or new_col >= n or
                new_row < 0 or new_col < 0 
                or grid[new_row][new_col] != -1
            ):
                self.change_direction()
                new_row, new_col = self.get_new_point()

            self.row, self.col = new_row, new_col
            grid[new_row][new_col] = self.get_new_ll_val()

        return grid

            

        
827