Commit 06e55b3

authored

Update 1778.Shortest-Path-in-a-Hidden-Grid.cpp

起始点是500, 数据范围是 1<= i , j <= 500, 所以最大点可能是[999,999],但是因为最大点还需要检测边界,所以需要1001的长度(OJ Case 36)。把矩阵改成1001之后提示stackoverflow, 把 dir 和 move 拉出去就可以通过了。

1 parent 866c184 commit 06e55b3Copy full SHA for 06e55b3

File tree

-8

lines changed

DFS/1778.Shortest-Path-in-a-Hidden-Grid
- 1778.Shortest-Path-in-a-Hidden-Grid.cpp

-8

lines changed

Lines changed: 6 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -12,17 +12,17 @@`
`12`	`12`	`typedef pair<int,int> PII;`
`13`	`13`
`14`	`14`	`class Solution {`
`15`		`- int grid[1000][1000];`
`16`		`- int visited[1000][1000];`
`17`		`- int visited2[1000][1000];`
	`15`	`+ int grid[1001][1001];`
	`16`	`+ int visited[1001][1001];`
	`17`	`+ int visited2[1001][1001];`
	`18`	`+ vector<PII> dir{{-1,0},{1,0},{0,-1},{0,1}};`
	`19`	`+ vector<char> move{'U','D','L','R'};`
`18`	`20`	`public:`
`19`	`21`	`int findShortestPath(GridMaster &master)`
`20`	`22`	`{`
`21`	`23`	`visited[500][500] = 1;`
`22`	`24`	`dfs(500, 500, master);`
`23`		`-`
`24`		`- auto dir = vector<PII>({{-1,0},{1,0},{0,-1},{0,1}});`
`25`		`-`
	`25`	`+`
`26`	`26`	`queue<PII>q;`
`27`	`27`	`q.push({500,500});`
`28`	`28`	`visited2[500][500]=1;`
`@@ -56,8 +56,6 @@ class Solution {`
`56`	`56`
`57`	`57`	`void dfs(int i, int j, GridMaster &master)`
`58`	`58`	`{`
`59`		`- auto dir = vector<PII>({{-1,0},{1,0},{0,-1},{0,1}});`
`60`		`- vector<char> move({'U','D','L','R'});`
`61`	`59`
`62`	`60`	`grid[i][j] = 1;`
`63`	`61`

Comments

(0)