Description

We have a list of bus routes. Each routes[i] is a bus route that the i-th bus repeats forever. For example if routes[0] = [1, 5, 7], this means that the first bus (0-th indexed) travels in the sequence 1->5->7->1->5->7->1->... forever.

We start at bus stop S (initially not on a bus), and we want to go to bus stop T. Travelling by buses only, what is the least number of buses we must take to reach our destination? Return -1 if it is not possible.

Example:
Input: 
routes = [[1, 2, 7], [3, 6, 7]]
S = 1
T = 6

Output: 2
Explanation: 
The best strategy is take the first bus to the bus stop 7, then take the second bus to the bus stop 6.

Note:

• 1 <= routes.length <= 500.
• 1 <= routes[i].length <= 500.
• 0 <= routes[i][j] < 10 ^ 6.

Discuss

使用廣度遍歷诫隅。首先把每一站的可達(dá)bus數(shù)存起來烹骨，也就是把每一站出現(xiàn)的行存起來驰徊。然后從起始站開始读宙，把可達(dá)的每一個bus站都存入隊列撞牢，依次遍歷摆马，一直到最后的終點(diǎn)站結(jié)束性穿。

Code

class Solution {
    public int numBusesToDestination(int[][] routes, int S, int T) {
        HashSet<Integer> visited = new HashSet<>();
        Queue<Integer> q = new LinkedList<>();
        Map<Integer, ArrayList<Integer>> map = new HashMap<>();
        
        int res = 0;
        if (S == T) { return 0; }
        
        for (int i = 0; i < routes.length; i++) {
            for (int j = 0; j < routes[0].length; j++) {
                //把每一站出現(xiàn)的行記錄下來停蕉，如{[1,2,7],[3,6,7]}中愕鼓，7出現(xiàn)了兩次，就把0,1添加進(jìn)list中
                ArrayList<Integer> list = map.getOrDefault(routes[i][j], new ArrayList<Integer>());
                list.add(i);
                map.put(routes[i][j], list);
            }
        }
        
        q.offer(S);
        while (!q.isEmpty()) {
            //所有與S相連的元素的個數(shù)
            int len = q.size();
            res++;
            for (int i = 0; i < len; i++) {
                int s = q.poll();
                ArrayList<Integer> list = map.get(s);
                for (int bus : list) {
                    if (visited.contains(bus)) continue;
                    visited.add(bus);
                    for (int j = 0; j < routes[bus].length; j++) {
                        if (routes[bus][j] == T) return res;
                        q.offer(routes[bus][j]);
                    }
                }
            }
        }
        return -1;
    }
}