Minimum Grid Path Sum in Java

// Minimum Grid Path Sum in Java
//
// PURPOSE
// A minimum path through a cost grid combines optimal results from above and left when
// movement is restricted to right or down.
//
// METHOD
// Use one row of cumulative costs. Initialize the first row and column, then add each cell
// cost to the cheaper predecessor.
//
// COMPLEXITY
// O(rows * cols) time, O(cols) auxiliary space.
//
// CONTRACT
// rows,cols>=1. grid is a flattened matrix of nonnegative costs. All sums must fit signed
// 32-bit.
// Public APIs infer array lengths except in C, which accepts pointer/length pairs. Vertex
// counts and matrix dimensions remain explicit. Arrays must contain signed 32-bit integers.
// Sorted order, correct tree topology, and caller-owned data-structure invariants are
// preconditions; checking them on every query would change query complexity.
// Scalar and shape checks are included. Value-range checks are included where needed to
// prevent invalid indexing or nontermination. Allocation sizes are capped at 4,000,000
// workspace entries. Arithmetic outside Python raises an error on 32-bit overflow; Python
// uses arbitrary precision. Native allocation failures propagate. In-place outputs may be
// partly updated after arithmetic failure. These are single-threaded, in-memory
// implementations.
//
// LANGUAGE DETAILS
// Java 17+: primitive int arrays, Arrays.binarySearch for LIS, and Math exact arithmetic.
// Invalid input throws IllegalArgumentException; arithmetic overflow throws
// ArithmeticException.
//
// EXAMPLE
// Expected return: 7.
// Run: javac AlgorithmExample.java && java AlgorithmExample
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

class AlgorithmExample {
    static void alg_require(boolean valid) { if (!valid) throw new IllegalArgumentException("invalid algorithm input"); }
    static int alg_size(int n) { alg_require(n>=0 && n<=4000000); return n; }

    static int minimum_path_sum(int[] grid, int rows, int cols) {
        java.util.Objects.requireNonNull(grid, "grid");
        alg_require((grid.length == Math.multiplyExact(rows, cols)));
        alg_require(((rows >= 1) && (cols >= 1) && (rows <= 1000000) && (cols <= 1000000)));
        int[] dp = new int[alg_size(cols)];
        int r = 0;
        int c = 0;
        while ((r < rows)) {
            c = 0;
            while ((c < cols)) {
                if (((r == 0) && (c == 0))) {
                    dp[c] = grid[0];
                } else {
                    if ((r == 0)) {
                        dp[c] = Math.addExact(dp[Math.subtractExact(c, 1)], grid[c]);
                    } else {
                        if ((c == 0)) {
                            dp[c] = Math.addExact(dp[c], grid[Math.multiplyExact(r, cols)]);
                        } else {
                            dp[c] = Math.addExact(Math.min(dp[c], dp[Math.subtractExact(c, 1)]), grid[Math.addExact(Math.multiplyExact(r, cols), c)]);
                        }
                    }
                }
                c = Math.addExact(c, 1);
            }
            r = Math.addExact(r, 1);
        }
        return dp[Math.subtractExact(cols, 1)];
    }

    public static void main(String[] args) {
        int[] grid = new int[] {1, 3, 1, 1, 5, 1, 4, 2, 1};
        int rows = 3;
        int cols = 3;
        int result = minimum_path_sum(grid, rows, cols);
        System.out.println(result);
    }
}