64.最小路径和.cpp

/*
 * @lc app=leetcode.cn id=64 lang=cpp
 *
 * [64] 最小路径和
 */

// @lc code=start
class Solution {
public:
    int minPathSum(vector<vector<int>>& o) {
        int m = o.size(), n = o[0].size();
        if (!m) return 0; // leetcode 特色
        vector<vector<int>> f(m, vector<int> (n, INT_MAX));
        f[0][0] = o[0][0];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (i) f[i][j] = min(f[i - 1][j] + o[i][j], f[i][j]);
                if (j) f[i][j] = min(f[i][j - 1] + o[i][j], f[i][j]);
            }
        }
        return f[m - 1][n - 1];
    }
};
// @lc code=end