CPMagical CP Library

Problem solution · Java

Minimum Cost to Make at Least One Valid Path in a Grid

Minimum Cost to Make at Least One Valid Path in a 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
38 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 Cost to Make at Least One Valid Path in a 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

  • 38 lines of Java from the credited upstream file 1368.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 Cost to Make at Least One Valid Path in a Grid · JavaJava
Use this to learn the idea, then write your own version.
class Solution {  public int minCost(int[][] grid) {    final int m = grid.length;    final int n = grid[0].length;    int[][] mem = new int[m][n];    Arrays.stream(mem).forEach(A -> Arrays.fill(A, -1));    Queue<Pair<Integer, Integer>> q = new ArrayDeque<>();     dfs(grid, 0, 0, /*cost=*/0, q, mem);     for (int cost = 1; !q.isEmpty(); ++cost)      for (int sz = q.size(); sz > 0; --sz) {        Pair<Integer, Integer> pair = q.poll();        final int i = pair.getKey();        final int j = pair.getValue();        for (int[] dir : DIRS)          dfs(grid, i + dir[0], j + dir[1], cost, q, mem);      }     return mem[m - 1][n - 1];  }   private static final int[][] DIRS = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};   private void dfs(int[][] grid, int i, int j, int cost, Queue<Pair<Integer, Integer>> q,                   int[][] mem) {    if (i < 0 || i == grid.length || j < 0 || j == grid[0].length)      return;    if (mem[i][j] != -1)      return;     mem[i][j] = cost;    q.add(new Pair<>(i, j));    int[] dir = DIRS[grid[i][j] - 1];    dfs(grid, i + dir[0], j + dir[1], cost, q, mem);  }}

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 ↗