Skip to main content

Breadth-first Search - Hard - Question 1

Breadth-first Search - Hard - Question 1


815. Bus Routes

You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever.

For example, if routes[0] = [1, 5, 7], this means that the 0th bus travels in the sequence 1 -> 5 -> 7 -> 1 -> 5 -> 7 -> 1 -> ... forever.

You will start at the bus stop source (You are not on any bus initially), and you want to go to the bus stop target. You can travel between bus stops by buses only.

Return the least number of buses you must take to travel from source to target. Return -1 if it is not possible.

Constraints:

1 <= routes.length <= 500.

1 <= routes[i].length <= 10^5

All the values of routes[i] are unique.

sum(routes[i].length) <= 10^5

0 <= routes[i][j] < 10^6

0 <= source, target < 10^6


Analysis:

One of key steps to this question is to build the connections.

For example, once we start with the source stop, then we know what is the next stops to go. With the connections, we should quickly know what they are (without scanning the raw data).

This connection is usually called a graph.

After having this graph, we can do a regular breadth-first search (bfs) for the shortest distance. And also, to avoid redundant visits, we can use a visit array to record this.


See the code below:

class Solution {
public:
    int numBusesToDestination(vector<vector<int>>& routes, int source, int target) {
        int res = 0, n = routes.size();
        if(source == target) return res;
        unordered_map<int, vector<int>> data;
        for(int i=0; i<n; ++i) {
            for(auto &a : routes[i]) {
                data[a].push_back(i);
            }
        }
        vector<int> hs(n, 0), vt(n, 0);
        for(auto &a : data[target]) hs[a] = 1;
        queue<int> q;
        for(auto &a : data[source]) {
            q.push(a);
            vt[a] = 1;
        }
        while(q.size()) {
            ++res;
            int k = q.size();
            for(int i=0; i<k; ++i) {
                auto t = q.front();
                q.pop();
                if(hs[t]) return res;
                for(auto &b : routes[t]) {
                    for(auto &a : data[b]) {
                        if(!vt[a]) {
                            q.push(a);
                            vt[a] = 1;
                        }
                    }
                }
            }
        }
        return -1;
    }
};


Upper Layer




Comments

Popular posts from this blog

Trie

Trie is a data structure belonging to n-ary trees, which is designed for some specific questions, such as, prefix of strings. (If you have never known what binary tree is, maybe you can check binary tree first before read more about Trie). The fact that there are only 26 different letters greatly reduce the possible choices for each position. Or to make it clear, for each position, there are 26 different choices. In mathematics, it seems to be very large (height^26 for the full tree), but in reality, it is rare to be a full tree for the set of meaningful strings (needs at least height^26 strings to be a full tree!), since the height or length of English words are less than 10 in most cases. Therefore, it is popular in string matching or related operations. Please be noted that the trie structure is not only limited to strings, the same idea can be extended to other data types, such as integer (then it becomes a binary tree, since for bit, there are only two possible values). In the cod...

Stack - Question 1

Questions: We have an integer array with size n. The index of the first number is 0, and the last one is n-1. For each number, please find the index of the first number higher than it on the right side. If there is no such number, return -1. Constains: 1 <= n <= 10^5 Analysis: If we fix each number, then run a for loop for all the numbers on its right side in the array, we can find the first number that is larger. But the time complexity would be O(N^2) overall. We need to find a solution that runs faster. A stack can be used for this: since we are looking for the first element higher on the right side, we can maintain a monotonically decreasing order inside the stack. When scanning to a new number,  1. if the stack is empty or the top element (the end of the numbers in the stack) is larger, just put the new number in the stack. Since the new number is smaller, the numbers in the stack still decreases; 2. if the stack is not empty and the top element is smaller than the new n...