Bus Routes

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.

思路：这题的题意是：同一个bus 线路的只算一趟车，也就是算一步而已, station 是node，那么下一层就是这个station属于哪几条line，这几条line上面的所有的station就是下一层，也就是这个station，可以转乘到哪几条其他的line上面；Time: O(V + E); Space: O(V);

class Solution {
    public int numBusesToDestination(int[][] routes, int source, int target) {
        HashMap<Integer, HashSet<Integer>> graph = new HashMap<>();
        for(int i = 0; i < routes.length; i++) {
            for(int j = 0; j < routes[i].length; j++) {
                int bus = i;
                int station = routes[i][j];
                graph.putIfAbsent(station, new HashSet<Integer>());
                graph.get(station).add(bus);
            }
        }
        
        Queue<Integer> queue = new LinkedList<>();
        queue.offer(source);
        HashSet<Integer> visited = new HashSet<>();
        int step = 0;
        
        while(!queue.isEmpty()) {
            int size = queue.size();
            for(int i = 0; i < size; i++) {
                Integer node = queue.poll();
                if(node == target) {
                    return step;
                }
                if(graph.get(node) != null) {
                    for(Integer bus: graph.get(node)) {
                        if(!visited.contains(bus)) {
                            visited.add(bus);
                            // add的是下一层bus的station；
                            for(int j = 0; j < routes[bus].length; j++) {
                                queue.offer(routes[bus][j]);
                            }
                        }
                    }
                }
            }
            step++;
        }
        return -1;
    }
}