Minimum Grid Path Sum in JavaScript

"use strict";
// Minimum Grid Path Sum in JavaScript
//
// 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
// Node.js 18+: Int32Array inputs and workspaces provide compact integer storage. Automatic
// lengths and checked arithmetic reject values outside signed 32-bit. Invalid inputs or
// overflow throw RangeError.
//
// EXAMPLE
// Expected return: 7.
// Run: node example.js
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

function alg_require(valid) { if (!valid) throw new RangeError("invalid algorithm input"); }
function alg_checked(v) { if (!Number.isInteger(v) || v < -2147483648 || v > 2147483647) throw new RangeError("32-bit result overflow"); return v; }
function alg_add(a,b) { return alg_checked(a+b); }
function alg_sub(a,b) { return alg_checked(a-b); }
function alg_mul(a,b) { return alg_checked(a*b); }
function alg_size(n) { alg_require(Number.isInteger(n) && n>=0 && n<=4000000); return n; }

function minimum_path_sum(grid, rows, cols) {
    alg_require(grid instanceof Int32Array);
    alg_require(Number.isInteger(rows) && rows >= -2147483648 && rows <= 2147483647);
    alg_require(Number.isInteger(cols) && cols >= -2147483648 && cols <= 2147483647);
    alg_require((grid.length == alg_mul(rows, cols)));
    alg_require(((rows >= 1) && (cols >= 1) && (rows <= 1000000) && (cols <= 1000000)));
    let dp = new Int32Array(alg_size(cols));
    let r = 0;
    let 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] = alg_add(dp[alg_sub(c, 1)], grid[c]);
                } else {
                    if ((c == 0)) {
                        dp[c] = alg_add(dp[c], grid[alg_mul(r, cols)]);
                    } else {
                        dp[c] = alg_add(Math.min(dp[c], dp[alg_sub(c, 1)]), grid[alg_add(alg_mul(r, cols), c)]);
                    }
                }
            }
            c = alg_add(c, 1);
        }
        r = alg_add(r, 1);
    }
    return dp[alg_sub(cols, 1)];
}

let grid = new Int32Array([1, 3, 1, 1, 5, 1, 4, 2, 1]);
let rows = 3;
let cols = 3;
let result = minimum_path_sum(grid, rows, cols);
console.log(result);