<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:
    def spiralMatrix(self, m: int, n: int, head: Optional[ListNode]) -> List[List[int]]:
        matrix = []
        for i in range(m):
            r = []
            for i in range(n):
                r.append(-1)
            matrix.append(r)
        
        left, right = 0, n
        top, bottom = 0, m
        l, k = [], 0

        current = head
        while current:
            l.append(current.val)
            current = current.next

        while True:
            #put i in top row
            for i in range(left, right):
                if k==(len(l)-1):
                    matrix[top][i] = l[k]
                    return matrix
                else:
                    matrix[top][i] = l[k]
                    k += 1
            top += 1
            #put i in right col
            for i in range(top, bottom):
                if k==(len(l)-1):
                    matrix[i][right - 1] = l[k]
                    print('right col')
                    return matrix
                else:
                    matrix[i][right - 1] = l[k]
                    k += 1
            right -= 1
            
            #put i in bottom row
            for i in range(right - 1, left - 1, -1):
                if k==(len(l)-1):
                    matrix[bottom - 1][i] = l[k]
                    print('bottom row')
                    return matrix
                else:
                    matrix[bottom - 1][i] = l[k]
                    k += 1
            bottom -= 1
            #put i in left row
            for i in range(bottom - 1, top - 1, -1):
                if k==(len(l)-1):
                    matrix[i][left] = l[k]
                    print('left row')
                    return matrix
                else:
                    matrix[i][left] = l[k]
                    k += 1
            left += 1
            if k==(len(l)-1):
                print('next')
        return matrix
684