CPMagical CP Library

Problem solution · Java

Minimum Path Cost in a Hidden Grid

Minimum Path Cost in a Hidden Grid: a Java solution using breadth-first search. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Breadth-first search
Source
walkccc LeetCode Solutions
Length
75 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Breadth-first search

For Minimum Path Cost in a Hidden Grid, the implementation explores reachable states in layers, which is the standard shape for unweighted shortest paths and minimum-step transitions.

  1. Model each valid configuration as a state and each legal move as an edge.
  2. Seed the queue with the starting state and mark it immediately.
  3. Expand each state once, recording distance or reachability for unseen neighbours.

Code notes

  • 75 lines of Java from the credited upstream file 1810.java.
  • The implementation visibly relies on sequence storage, work queue.
  • 3 loop blocks detected, together with recursive traversal.

Complexity

Verify that each state and transition is processed only a bounded number of times; that determines the traversal cost.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeMinimum Path Cost in a Hidden Grid · JavaJava
Use this to learn the idea, then write your own version.
/** * // This is the GridMaster's API interface. * // You should not implement it, or speculate about its implementation * class GridMaster { *   boolean canMove(char direction); *   int move(char direction); *   boolean isTarget(); * } */ class Solution {  public int findShortestPath(GridMaster master) {    final int m = 100;    final int startX = m;    final int startY = m;    int[] target = {m * 2, m * 2};    int[][] grid = new int[m * 2][m * 2];    boolean[][] seen = new boolean[m * 2][m * 2];    Arrays.stream(grid).forEach(A -> Arrays.fill(A, -1));     // Build the grid information by DFS.    dfs(master, grid, startX, startY, target);     Queue<int[]> minHeap = new PriorityQueue<>(Comparator.comparingInt(a -> a[2])) {      { offer(new int[] {startX, startY, 0}); }    };     // Find the steps by BFS.    while (!minHeap.isEmpty()) {      final int i = minHeap.peek()[0];      final int j = minHeap.peek()[1];      final int cost = minHeap.poll()[2];      if (i == target[0] && j == target[1])        return cost;      if (seen[i][j])        continue;      seen[i][j] = true;      for (int[] dir : DIRS) {        final int x = i + dir[0];        final int y = j + dir[1];        if (x < 0 || x == 2 * m || y < 0 || y == 2 * m)          continue;        if (seen[x][y] || grid[x][y] == -1)          continue;        final int nextCost = cost + grid[x][y];        minHeap.offer(new int[] {x, y, nextCost});      }    }     return -1;  }   private static final int[][] DIRS = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};  private static final char[] charTable = {'R', 'D', 'L', 'U'};   private void dfs(GridMaster master, int[][] grid, int i, int j, int[] target) {    if (master.isTarget()) {      target[0] = i;      target[1] = j;    }     for (int k = 0; k < 4; ++k) {      final int x = i + DIRS[k][0];      final int y = j + DIRS[k][1];      final char d = charTable[k];      final char undoD = charTable[(k + 2) % 4];      if (master.canMove(d) && grid[x][y] == -1) {        grid[x][y] = master.move(d);        dfs(master, grid, x, y, target);        master.move(undoD);      }    }  }}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗