您當(dāng)前位置：首頁 > php開源 > php教程 > Leetcode 62 Unique Paths

Leetcode 62 Unique Paths

來源：程序員人生發(fā)布時(shí)間：2016-11-21 08:40:59 閱讀次數(shù)：2416次

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

How many possible unique paths are there?

Above is a 3 x 7 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

DP基礎(chǔ)題，不多說了，左和上方轉(zhuǎn)移

class Solution { public: int uniquePaths(int m, int n) { vector<int> row(n+1,0); vector<vector<int>> dp(m+1,row); dp[0][1]=1; for(int i=1;i<=m;i++) for(int j=1;j<=n;j++) dp[i][j]=dp[i⑴][j]+dp[i][j⑴]; return dp[m][n]; } };

生活不易，碼農(nóng)辛苦
如果您覺得本網(wǎng)站對(duì)您的學(xué)習(xí)有所幫助,可以手機(jī)掃描二維碼進(jìn)行捐贈(zèng)
程序員人生

------分隔線----------------------------

上一篇 如何在百寶云應(yīng)用中心發(fā)布自己的應(yīng)用

下一篇 Android官方開發(fā)文檔Training系列課程中文版：電池續(xù)航時(shí)間優(yōu)化之監(jiān)測(cè)電池電量及充電狀態(tài)

分享到:

------分隔線----------------------------

為碼而活

積分：4237

15粉絲

7關(guān)注

欄目熱點(diǎn)

多多色-多人伦交性欧美在线观看-多人伦精品一区二区三区视频-多色视频-免费黄色视屏网站-免费黄色在线

Leetcode 62 Unique Paths