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

Post a Comment

Popular posts from this blog

Brute Force - Question 2

2105. Watering Plants II Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters the plants in order from right to left, starting from the (n - 1)th plant. They begin watering the plants simultaneously. It takes the same amount of time to water each plant regardless of how much water it needs. Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant. In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice ...
Post a Comment
Read more

Sliding Window - Question 1

Leetcode 76. Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "". The testcases will be generated such that the answer is unique. A substring is a contiguous sequence of characters within the string. Constraints: m == s.length n == t.length 1 <= m, n <= 10^5 s and t consist of uppercase and lowercase English letters. Analysis: The first step to do is to count the letters in string t, since the relative order of chars does not matter. After the counting, we can use two pointers method on string s: starting with beginning of the string s, the second pointer can continue to move until the sub-string [i, j) has all the chars in t, where i the index of the first pointer, and j is the index of the second pointer. We are looking for the sub-string with the minimum leng...
Post a Comment
Read more