Leetcode 64. Minimum Path Sum (Medium) (cpp)

Leetcode 64. Minimum Path Sum (Medium) (cpp)

Tag: Array, Dynamic Programming

Difficulty: Medium

/*64. Minimum Path Sum (Medium)Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any point in time.*/class Solution {public:    int minPathSum(vector<vector<int>>& grid) {        if (grid.empty()) {            return 0;        }        int _size = grid[0].size();        vector<int> res(_size, INT_MAX);        res[0] = 0;        for (int i = 0; i < grid.size(); i++) {            res[0] += grid[i][0];            for (int j = 1; j < _size; j++) {                res[j] = min(res[j - 1], res[j]) + grid[i][j];            }        }        return res[_size - 1];    }};