[Go] ♻️ In-place with max on 6 elements (instead of 9)
Intuition\n Describe your first thoughts on how to solve this problem. \nSpace reuse and computation results reuse \u267B\uFE0F\n\n # Approach \n Describe your 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n**Space** reuse and computation **results** reuse \u267B\uFE0F\n\n<!-- # Approach -->\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: $$O(n^2)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nfunc largestLocal(grid [][]int) [][]int {\n\tI, J := len(grid)-2, len(grid[0])-2\n\tfor i, row := range grid[:I] {\n\t\trow[0] = max(row[0], grid[i+1][0], grid[i+2][0])\n\t\trow[1] = max(row[1], grid[i+1][1], grid[i+2][1])\n\t\tfor j, x := range row[:J] {\n\t\t\trow[j+2] = max(row[j+2], grid[i+1][j+2], grid[i+2][j+2])\n\t\t\trow[j] = max(x, row[j+1], row[j+2])\n\t\t}\n\t\tgrid[i] = row[:J]\n\t}\n\treturn grid[:I]\n}\n```
['Go']