Lua矩阵路径：左上到右下的最小路径和

local function pathRec(g, i, j)
    if i == 1 and j == 1 then return g[1][1] end
    if i == 1 then
        return pathRec(g, 1, j - 1) + g[1][j]
    end
    if j == 1 then
        return pathRec(g, i - 1, 1) + g[i][1]
    end
    return math.min(pathRec(g, i - 1, j),
        pathRec(g, i, j - 1)) + g[i][j]
end

local function minPath(g)
    local m, n = #g, #g[1]
    local dp = {}
    for i = 0, m do dp[i] = {} end
    dp[0][0], dp[0][1], dp[1][0] = 0, 0, 0
    for i = 1, m do
        for j = 1, n do
            local from = math.min(dp[i - 1][j] or 0,
                dp[i][j - 1] or 0)
            dp[i][j] = from + g[i][j]
        end
    end
    return dp[m][n]
end
local p = getplayerbyname("path01")
sendmsg(p, 1, "最小路径和 " .. minPath({{1, 3, 1}, {1, 5, 1}, {4, 2, 1}}))