Leetcode 64 Solution

This article provides solution to leetcode question 64 (minimum-path-sum)
Categories:
Tags:
Access this page by simply typing in "lcs 64" in your browser address bar if you have bunnylol configured.

https://leetcode.com/problems/minimum-path-sum

Solution

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();



        if (m == 0)
            return 0;



        int n = grid[0].size();



        if (n == 0)
            return 0;



        vector<vector<int>> f;
        for (int i = 0; i < m; i++)
        {
            vector<int> tmp;
            tmp.resize(n);
            f.push_back(tmp);
        }



        f[0][0] = grid[0][0];



        for (int i = 1; i < m; i++)
            f[i][0] = f[i - 1][0] + grid[i][0];



        for (int i = 1; i < n; i++)
            f[0][i] = f[0][i - 1] + grid[0][i];



        for (int i = 1; i < m; i++)
        {
            for (int j = 1; j < n; j++)
            {
                f[i][j] = grid[i][j] + std::min(f[i - 1][j], f[i][j - 1]);
            }
        }



        return f[m - 1][n - 1];
    }
};