Skip to main content

Depth-first-search - medium level - question 2

Depth-first-search - medium level - question 2


2115. Find All Possible Recipes from Given Supplies

You have information about n different recipes. You are given a string array recipes and a 2D string array ingredients. The ith recipe has the name recipes[i], and you can create it if you have all the needed ingredients from ingredients[i]. Ingredients to a recipe may need to be created from other recipes, i.e., ingredients[i] may contain a string that is in recipes.

You are also given a string array supplies containing all the ingredients that you initially have, and you have an infinite supply of all of them.

Return a list of all the recipes that you can create. You may return the answer in any order.

Note that two recipes may contain each other in their ingredients.


Constraints:


n == recipes.length == ingredients.length

1 <= n <= 100

1 <= ingredients[i].length, supplies.length <= 100

1 <= recipes[i].length, ingredients[i][j].length, supplies[k].length <= 10

recipes[i], ingredients[i][j], and supplies[k] consist only of lowercase English letters.

All the values of recipes and supplies combined are unique.

Each ingredients[i] does not contain any duplicate values.



Analysis:

The main concern to this problem is time complexity.

One logic to this question is that once recipe may becomes an available ingredient to other recipes, which may make the previously un-created recipes becomes creatable.

If we handle the above situation to scan all the ingredients again, the time complexity would be too large, since for each newly created recipe, we need to a scan of all the ingredients.

But one scan needs O(numb of ingredients * numb of each ingredients) which is ~ 10^4.

The overall time complexity is O(numb of recipes * num of scans) ~ 10^6, which seems to be Okay for the OJ of Leetcode. But somehow cannot pass it and observed the following output with the following code,

112 / 112 test cases passed, but took too long.

class Solution {
public:
    vector<string> findAllRecipes(vector<string>& recipes, vector<vector<string>>& ingredients, vector<string>& supplies) {
        vector<string> res;
        int n = recipes.size();
        unordered_set<string> st;
        for(auto &a : supplies) st.insert(a);
        queue<int> q;
        q.push(-1);
        while(q.size()) {
            auto t = q.front();
            q.pop();
            cout<<t<<endl;
            for(int i=0; i<n; ++i) {
                if(st.count(recipes[i]) > 0) continue;
                bool flag = true;
                for(auto &a : ingredients[i]) {
                    if(st.count(a) == 0) {
                        flag = false;
                        break;
                    }
                }
                if(flag) {
                    st.insert(recipes[i]);
                    q.push(i);
                }
            }
        }
        for(int i=0; i<n; ++i) {
            if(st.count(recipes[i]) > 0) res.push_back(recipes[i]);
        }
        return res;
    }
};


How can we make it faster?

We do not need to rescan every ingredient once creating a recipe. If we consider the relationship between recipes & ingredients, it looks like a "build graph": the recipe is the build target, and all the ingredients are the dependencies.

So we try to use a top-down dfs method: when all the dependencies can be built, then the initial (or root) built target can be built as well. So it is a dfs problem in nature.

One place is that: we could have cyclic dependencies, so need to take care of this case by tracking the path when do the dfs.


See the code below:


class Solution {
public:
    vector<string> findAllRecipes(vector<string>& recipes, vector<vector<string>>& ingredients, vector<string>& supplies) {
        vector<string> res;
        int n = recipes.size();
        unordered_map<string, int> mp;
        for(int i=0; i<n; ++i) mp[recipes[i]] = i;
        unordered_set<string> st;
        for(auto &a : supplies) st.insert(a);
        for(auto &s : recipes) {
            // cout<<s<<endl;
            vector<int> visit(n, 0);
            dfs(s, mp, ingredients, st, res, visit);
        }
        return res;
    }
private:
    bool dfs(string& s, unordered_map<string, int>& mp, vector<vector<string>>& is, unordered_set<string>& st, vector<string>& res, vector<int>& visit) {
        if(mp.count(s) == 0) return false;
        if(mp[s] == -1) return true;
        int id = mp[s];
        // cout<<id<<endl;
        if(visit[id]) return false;
        visit[id] = 1;
        for(auto &a : is[id]) {
            if(st.count(a) == 0) {
                if(mp.count(a) == 0) return false;
                if(!dfs(a, mp, is, st, res, visit)) return false;
            }
        }
        res.push_back(s);
        mp[s] = -1;
        st.insert(s);
        return true;
    }
};



Upper Layer


Comments

Post a Comment

Popular posts from this blog

Binary Search - Hard Level - Question 3

Binary Search - Hard Level - Question 3 878. Nth Magical Number A positive integer is magical if it is divisible by either a or b. Given the three integers n, a, and b, return the nth magical number. Since the answer may be very large, return it modulo 10^9 + 7. Analysis: Let us consider some examples first. Example 1, a = 4, b = 2. If b is dividable by a, then all the numbers which is dividable by a should be dividable by b as well. So the nth magical number should be n*b; Example 2, a = 3, b = 2. The multiples of 2 are: 2, 4, 6, 8, 10, 12, ... The multiple of 3 are: 3, 6, 9, 12, ... So the overlap is related to the minimum common multiple between a and b, and we need to remove the overlap which is double-counted. So now, we make some conclusions: 1. the upper bound of the nth magical number should be n*b, where a is the smaller one (or b <= a); 2. there are n*b/a magical numbers smaller than n*b; 3. there are n*b/(minimum common multiple) overlaps. Thus, the overall count is: n + ...
Post a Comment
Read more

Segment Tree

Segment tree can be viewed as an abstract data structure which using some more space to trade for speed. For example, for a typical question with O(N^2) time complexity, the segment tree method can decrease it to O(N*log(N)).  To make it understandable, let us consider one example. Say we have an integer array of N size, and what we want is to query the maximum with a query range [idx1, idx2], where idx1 is the left indexes, and idx2 is the right indexes inclusive. If we only do this kind of query once, then we just need to scan through the array from idx1 to idx2 once, and record the maximum, done. The time complexity is O(N), which is decent enough in most cases even though it is not the optimal one (for example, with a segment tree built, the time complexity can decrease down to O(log(N))). However, how about we need to query the array N times? If we continue to use the naïve way above, then the time complexity is O(N^2), since for each query we need to scan the query range once...
Post a Comment
Read more

Recursion - Example

Recursion - Example Leetcode 231  Power of Two Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2^x Constraints: -2^31 <= n <= 2^31 - 1 Analysis: One way is to think about this question recursively: if n%2 == 1, then n must not be power of 2; if not, then we just need to consider whether (n/2) is a power of 2 or not. This is exactly the "same question with a smaller size"! It is trivial to figure out the base cases: if n == 0, return false; if n == 1, return true. See the code below: class Solution { public: bool isPowerOfTwo(int n) { // base cases if(n == 0) return false; if(n == 1) return true; // converging if(n%2 == 1) return false; return isPowerOfTwo(n/2); } }; If interested, there are some other ways to solve this problem. For example, using bit manipulation, we can have the following solution: class ...
Post a Comment
Read more