Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Hi, here's your problem today. This problem was recently asked by Uber:

Find the maximum number of connected colors in a grid.

class Grid: def init(self, grid): self.grid = grid

def max_connected_colors(self): # Fill this in.

grid = [[1, 0, 0, 1], [1, 1, 1, 1], [0, 1, 0, 0]]

print(Grid(grid).max_connected_colors())

7

Can you solve this both recursively and iteratively?