机器人路径规划：从 (0, 0) 到 (m, n) 的路径数量算法

#include <stdio.h> #include <string.h>

#define MAXX 51 #define MAXY 51

int m, n; int dp[MAXX][MAXY];

void solve() { int i, j;

dp[0][0] = 1;

memset(dp, 0, sizeof(dp));

for (i = 1; i <= m; i++) {
    dp[i][0] = 1;
    for (j = 1; j <= n; j++) {
        dp[0][j] = 1;
        dp[i][j] = dp[i][j-1] + dp[i-1][j];
    }
}

}

int main() { m = 5; n = 3;

solve();

printf('%d\n', dp[m][n]);

return 0;

}