Commit a837521

authored

add DFS solution(low efficiency)

1 parent 1fc4f28 commit a837521Copy full SHA for a837521

File tree

+25

-0

lines changed

+25

-0

lines changed

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,25 @@`
	`1`	`+class Solution {`
	`2`	`+private:`
	`3`	`+ void dfs(vector<vector<int>> &g,`
	`4`	`+ vector<vector<int>> &dis,`
	`5`	`+ int i, int j, int d)`
	`6`	`+ {`
	`7`	`+ if (i >= dis.size() \|\| j >= dis[0].size())`
	`8`	`+ return ;`
	`9`	`+`
	`10`	`+ d += g[i][j] ;`
	`11`	`+ if (dis[i][j] >= 0 && d >= dis[i][j])`
	`12`	`+ return ;`
	`13`	`+`
	`14`	`+ dis[i][j] = d ;`
	`15`	`+`
	`16`	`+ dfs(g, dis, i+1, j, d) ;`
	`17`	`+ dfs(g, dis, i, j+1, d) ;`
	`18`	`+ }`
	`19`	`+public:`
	`20`	`+ int minPathSum(vector<vector<int>>& grid) {`
	`21`	`+ vector<vector<int>> dis(grid.size(), vector<int>(grid.at(0).size(), -1)) ;`
	`22`	`+ dfs(grid, dis, 0, 0, 0) ;`
	`23`	`+ return dis.back().back() ;`
	`24`	`+ }`
	`25`	`+};`

Comments

(0)