Commit cfb9edf

committed

Update 게임-멥-최단거리.js

* 주석(레포 주소) 수정 * 함수 이름 변경 - isRoad -> isOut

1 parent e198e88 commit cfb9edfCopy full SHA for cfb9edf

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-// https://programmers.co.kr/learn/courses/30/lessons/1844`
	`1`	`+// https://github.com/codeisneverodd/programmers-coding-test`
`2`	`2`	`//정답 1 - prove-ability`
`3`	`3`	`function solution(maps) {`
`4`	`4`	`// BFS 활용`
`@@ -18,7 +18,7 @@ function solution(maps) {`
`18`	`18`	`// 다음 길 위치`
`19`	`19`	`const nextY = dy + y, nextX = dx + x;`
`20`	`20`	`// 맵 밖으로 나간다면`
`21`		`- if(isRoad(nextY, nextX, row, col)) continue;`
	`21`	`+ if(isOut(nextY, nextX, row, col)) continue;`
`22`	`22`	`// 도착한 곳이 벽이라면`
`23`	`23`	`if(maps[nextY][nextX] === 0) continue;`
`24`	`24`	`// 이미 지난 곳 벽으로 만들어서 다음에 접근 방지`
`@@ -37,4 +37,4 @@ function solution(maps) {`
`37`	`37`	`const DIRECTION = [[1, 0], [0, 1], [-1, 0], [0, -1]];`
`38`	`38`
`39`	`39`	`// 사용이 가능한 길인지 확인하는 함수`
`40`		`-const isRoad = (nextY, nextX, row, col) => nextY < 0 \|\| nextX < 0 \|\| nextY > row \|\| nextX > col;`
	`40`	`+const isOut = (nextY, nextX, row, col) => nextY < 0 \|\| nextX < 0 \|\| nextY > row \|\| nextX > col;`

Comments

(0)