Commit ff29bf9

author

fupengfei058

committed

02/10 COMMIT

1 parent dd47a7c commit ff29bf9Copy full SHA for ff29bf9

File tree

+16

-0

lines changed

+16

-0

lines changed

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,16 @@`
	`1`	`+/*Unique Paths:A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).`
	`2`	`+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).`
	`3`	`+How many possible unique paths are there?*/`
	`4`	`+class Solution {`
	`5`	`+public:`
	`6`	`+ int uniquePaths(int m, int n) {`
	`7`	`+ //dp Fn=Fn-1+Fn`
	`8`	`+ vector<int> vec(n, 1);`
	`9`	`+ for(int i=1; i<m; ++i){`
	`10`	`+ for(int j=1; j<n; ++j){`
	`11`	`+ vec[j]+=vec[j-1];`
	`12`	`+ }`
	`13`	`+ }`
	`14`	`+ return vec[n-1];`
	`15`	`+ }`
	`16`	`+};`

Comments

(0)