Leetcode answer (not working)

enclaves.go

type Cell struct {
    north, east, south, west int
}

func numEnclaves(grid [][]int) int {
    // return value of this func
    count := 0
    
    // row count
    m := len(grid)

    // column count
    n := len(grid[0])

    // To add up number of cells (1 or 0)
    rowSum := make([]int, m) 
    colSum := make([]int, n)

    cells := make([][]Cell, m)
    for index := range cells {
        cells[index] = make([]Cell, n)
    }

    for i := 0; i < m; i += 1 {

        // same row i
        for j := 0; j < n; j += 1 {
             
            if grid[i][j] == 1 {
                cells[i][j] = Cell{
                    west: rowSum[i],
                    north: colSum[j],
                }
            }
            // sum of i-th row numbers
            rowSum[i] += grid[i][j]

            // sum of j-th column numbers
            colSum[j] += grid[i][j]
        }
    }

    for i := 0; i < m; i += 1 {
        for j := 0; j < n; j += 1 {
            if grid[i][j] == 1 {
                cells[i][j].east = rowSum[i] - cells[i][j].west - grid[i][j]
                cells[i][j].south = colSum[j] - cells[i][j].north - grid[i][j]

                if isIsland(cells[i][j], m, n, i, j) {
                    count += 1
                }
            }   
        }
    }

    return count
}

func isIsland(cell Cell, m, n, i, j int) bool {
    if i == 0 || i == m - 1 || j == 0 || j == n - 1 {
        return false
    }

    return cell.north < i && cell.west < j && cell.south < m - i - 1 && cell.east < n - i - 1
}