<p>You are given an integer matrix <code>isWater</code> of size <code>m x n</code> that represents a map of <strong>land</strong> and <strong>water</strong> cells.</p>

<ul>
	<li>If <code>isWater[i][j] == 0</code>, cell <code>(i, j)</code> is a <strong>land</strong> cell.</li>
	<li>If <code>isWater[i][j] == 1</code>, cell <code>(i, j)</code> is a <strong>water</strong> cell.</li>
</ul>

<p>You must assign each cell a height in a way that follows these rules:</p>

<ul>
	<li>The height of each cell must be non-negative.</li>
	<li>If the cell is a <strong>water</strong> cell, its height must be <code>0</code>.</li>
	<li>Any two adjacent cells must have an absolute height difference of <strong>at most</strong> <code>1</code>. A cell is adjacent to another cell if the former is directly north, east, south, or west of the latter (i.e., their sides are touching).</li>
</ul>

<p>Find an assignment of heights such that the maximum height in the matrix is <strong>maximized</strong>.</p>

<p>Return <em>an integer matrix </em><code>height</code><em> of size </em><code>m x n</code><em> where </em><code>height[i][j]</code><em> is cell </em><code>(i, j)</code><em>&#39;s height. If there are multiple solutions, return <strong>any</strong> of them</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2021/01/10/screenshot-2021-01-11-at-82045-am.png" style="width: 220px; height: 219px;" /></strong></p>

<pre>
<strong>Input:</strong> isWater = [[0,1],[0,0]]
<strong>Output:</strong> [[1,0],[2,1]]
<strong>Explanation:</strong> The image shows the assigned heights of each cell.
The blue cell is the water cell, and the green cells are the land cells.
</pre>

<p><strong class="example">Example 2:</strong></p>

<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2021/01/10/screenshot-2021-01-11-at-82050-am.png" style="width: 300px; height: 296px;" /></strong></p>

<pre>
<strong>Input:</strong> isWater = [[0,0,1],[1,0,0],[0,0,0]]
<strong>Output:</strong> [[1,1,0],[0,1,1],[1,2,2]]
<strong>Explanation:</strong> A height of 2 is the maximum possible height of any assignment.
Any height assignment that has a maximum height of 2 while still meeting the rules will also be accepted.
</pre>

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

<ul>
	<li><code>m == isWater.length</code></li>
	<li><code>n == isWater[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 1000</code></li>
	<li><code>isWater[i][j]</code> is <code>0</code> or <code>1</code>.</li>
	<li>There is at least <strong>one</strong> water cell.</li>
</ul>

class Solution:
    def highestPeak(self, isWater: List[List[int]]) -> List[List[int]]:

        def get_neighbours(coord):

            row, col = coord

            # left, up, right, down
            row_delta = [0, -1, 0, 1]
            col_delta = [-1, 0, 1, 0]

            neighbour_coord = []

            for i in range(4):
                neighbour_coord.append((row_delta[i]+row,col_delta[i]+col))

            return neighbour_coord

        
        def bst(isWater, height):

            queue = []
            
            for i in range(len(isWater)):
                for j in range(len(isWater[i])):
                    if isWater[i][j] == 1:
                        queue.append((i,j))
            
            visited = set(queue)

            adjacent_height = 0

            while queue:
                new_queue = []

                for curr_spot in queue:
                    curr_row, curr_col = curr_spot

                    height[curr_row][curr_col] = adjacent_height

                    neighbours = get_neighbours(curr_spot)

                    for n in neighbours:
                        n_row, n_col = n

                        if 0 <= n_row < len(height) and 0 <= n_col < len(height[0]) and n not in visited:
                            new_queue.append(n)
                            visited.add(n)
                    
                queue = new_queue
                adjacent_height += 1
            return height
                           

            #     if isWater[curr_row][curr_col] == 1:
            #         height[curr_row][curr_col] = 0
            #     else:
            #         height[curr_row][curr_col] = min_height + 1

            #     print("height", height)

            # return height

                    

        

        height = []

        for i in range(len(isWater)):
            height.append([])
            for j in range(len(isWater[i])):
                    height[i].append(0)
        
        print(height)

        return bst(isWater, height)
            
        

3485