search

seunzu / hk-toss

[hk-toss] full-stack
0 stars 0 forks source link

0926 - BFS #9

Closed seunzu closed 1 month ago

seunzu commented 1 month ago

1 탐색

//        0,0 출발점 , 4,4 가 도착점
//        1: 길,  0: 벽
//        최단 거리
        int[][] map = {
                {1, 0, 1, 1, 1},
                {1, 0, 1, 0, 1},
                {1, 0, 1, 0, 1},
                {1, 0, 1, 1, 1},
                {1, 1, 1, 0, 1},
        };
        Solution solution = new Solution();
        int minDistance= solution.solve(map); // 11
        System.out.println(minDistance);