[Kotlin/프로그래머스] 코딩테스트 연습 > 연습문제 > 리코쳇 로봇

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
class Solution {
fun solution(t: String, p: String): Int {
val queue: Queue<Triple<Int, Int, Int>> = LinkedList()
val isVisited = Array(board.size) { BooleanArray(board[0].length) }

    run loop@{
        board.forEachIndexed { index, s ->
            val j = s.indexOf('R')
            if (j != -1) {
                isVisited[index][j] = true
                queue.offer(Triple(index, j, 0))
                return@loop
            }
        }
    }

    val direction = arrayOf(
        intArrayOf(0, 1), intArrayOf(0, -1), intArrayOf(-1, 0), intArrayOf(1, 0)
    )

    while (queue.isNotEmpty()) {
        val item = queue.poll()
        for (i in 0 until 4) {
            var x = item.first
            var y = item.second
            val addX = direction[i][0]
            val addY = direction[i][1]
            while (x + addX in board.indices && y + addY in 0 until board[0].length
                && board[x + addX][y + addY] != 'D'
            ) {
                x += addX
                y += addY
            }
            if (!isVisited[x][y]) {
                if (board[x][y] == 'G') {
                    return item.third + 1
                } else {
                    isVisited[x][y] = true
                    queue.offer(Triple(x, y, item.third + 1))
                }
            }
        }
    }
    return -1
}