[Python] Very simple CLEAN code solution | Beats 100%
\n\n\n\nclass Solution:\n    def largestLocal(self, grid):\n        n = len(grid)\n        local_values = []\n\n        for row in range(n - 2):\n            lo
![image](https://assets.leetcode.com/users/images/40120193-1cb2-468f-985c-59cf06197003_1660451102.873174.png)\n\n\n```\nclass Solution:\n    def largestLocal(self, grid):\n        n = len(grid)\n        local_values = []\n\n        for row in range(n - 2):\n            local_values.append([])\n            for col in range(n - 2):\n                row_one = max(grid[row][col : col + 3])\n                row_two = max(grid[row + 1][col : col + 3])\n                row_three = max(grid[row + 2][col : col + 3])\n\n                max_local = max(row_one, row_two, row_three)\n                local_values[row].append(max_local)\n\n        return local_values\n```
['Python']