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

  • patrickgao2020
     + 0 comments

    Here is my Python code utilizing list comprehensions! However, this does result in a line being incredibly long.

    def cavityMap(grid):
    changes = [(i + 1, num + 1) for i in range(len(grid) - 2) for num in range(len(grid[i + 1]) - 2) if grid[i + 1][num] < grid[i + 1][num + 1] and grid[i + 1][num + 1] > grid[i + 1][num + 2] and grid[i][num + 1] < grid[i + 1][num + 1] and grid[i + 2][num + 1] < grid[i + 1][num + 1]]
    for change in changes:
        grid[change[0]] = grid[change[0]][:change[1]] + "X" + grid[change[0]][change[1] + 1:]
    return grid