【动态规划】机器人走m*n宫格

---

一、题目描述

二、代码实现

#include<iostream>
#include<vector>

using namespace std;
void Robits(vector<vector<int>>& dp)
{
    for (int i = 0; i < dp.size(); ++i)
    {
        for (int j = 0; j < dp[i].size(); ++j)
        {
            if (i == 0 || j == 0)
            {
                dp[i][j] = 1;
            }
            else
            {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
    }
}
void print(vector<vector<int>>& dp)
{
    for (int i = 0; i < dp.size(); ++i)
    {
        for (int j = 0; j < dp[i].size(); ++j)
        {
            cout << dp[i][j] << " ";
        }
        cout << endl;
    }
    cout << endl;
}

int main()
{
    vector<vector<int>> dp;
    dp.resize(4);
    for (auto& x : dp)
    {
        x.resize(6);
    }
    Robits(dp);
    print(dp);
    return 0;
}