We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Cavity Map
  5. Discussions

Cavity Map

  • allan_mcelroy
     + 0 comments

    I employed a very similar method:

    def cavityMap(grid):
if n < 3:
    return grid
else:
    for idx, row in enumerate(grid[1:-1]):
        for jdx, i in enumerate(row[1:-1]):
            if all([grid[idx][jdx+1]<i, grid[idx+2][jdx+1]<i, 
            row[jdx] < i , row[jdx+2] < i]):
                grid[idx+1] = grid[idx+1][:jdx+1] + 'X' + grid[idx+1][jdx+2:]
    return grid