【LeetCode】minimum-path-sum

• 题目：

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.

• 代码：

#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
int min(int a, int b){
    return a < b ? a : b;
}
//动态规划
int minPathSum(vector<vector<int>>&grid){
    if (grid.size() == 0)return 0;
    const int m = grid.size();
    const int n = grid[0].size();
    int f[20][20];
    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] = min(f[i - 1][j], f[i][j - 1]) + grid[i][j];
        }
    }
    return f[m - 1][n - 1];
}
int main(){
    vector<vector<int>>grid;
    int m, n;
    cin >> m >> n;
    for (int i = 0; i < m; i++)
        grid.push_back(vector<int>(n));
    for (int i = 0; i < m;i++)
    for (int j = 0; j < n; j++)
        cin >> grid[i][j];
    cout << minPathSum(grid) << endl;
    return 0;
}