Leetcode 64. Minimum Path Sum

Given an m×n grid of non-negative numbers, find the minimum-sum path from the top-left to bottom-right when you may only move right or down. This is a classic grid dynamic-programming problem computing cumulative minimum sums (optimal O(mn) time).