LeetCode-in-Java

2115. Find All Possible Recipes from Given Supplies

Medium

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.

Example 1:

Input: recipes = [“bread”], ingredients = [[“yeast”,”flour”]], supplies = [“yeast”,”flour”,”corn”]

Output: [“bread”]

Explanation: We can create “bread” since we have the ingredients “yeast” and “flour”.

Example 2:

Input: recipes = [“bread”,”sandwich”], ingredients = [[“yeast”,”flour”],[“bread”,”meat”]], supplies = [“yeast”,”flour”,”meat”]

Output: [“bread”,”sandwich”]

Explanation:

We can create “bread” since we have the ingredients “yeast” and “flour”.

We can create “sandwich” since we have the ingredient “meat” and can create the ingredient “bread”.

Example 3:

Input: recipes = [“bread”,”sandwich”,”burger”], ingredients = [[“yeast”,”flour”],[“bread”,”meat”],[“sandwich”,”meat”,”bread”]], supplies = [“yeast”,”flour”,”meat”]

Output: [“bread”,”sandwich”,”burger”]

Explanation:

We can create “bread” since we have the ingredients “yeast” and “flour”.

We can create “sandwich” since we have the ingredient “meat” and can create the ingredient “bread”.

We can create “burger” since we have the ingredient “meat” and can create the ingredients “bread” and “sandwich”.

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.

Solution

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;

public class Solution {
    public List<String> findAllRecipes(
            String[] recipes, List<List<String>> ingredients, String[] supplies) {
        Map<String, Integer> indegree = new HashMap<>();
        Set<String> supplySet = new HashSet<>();
        Map<String, Set<String>> adj = new HashMap<>();
        Collections.addAll(supplySet, supplies);
        for (String recipe : recipes) {
            indegree.put(recipe, 0);
        }

        for (int i = 0; i < recipes.length; ++i) {
            String recipe = recipes[i];
            int numberOfDependencies = 0;
            for (String ingredient : ingredients.get(i)) {
                if (!supplySet.contains(ingredient)) {
                    adj.computeIfAbsent(ingredient, x -> new HashSet<>()).add(recipe);
                    numberOfDependencies++;
                }
            }
            indegree.put(recipe, numberOfDependencies);
        }
        Queue<String> q = new LinkedList<>();
        for (Map.Entry<String, Integer> entry : indegree.entrySet()) {
            if (entry.getValue() == 0) {
                q.add(entry.getKey());
            }
        }
        List<String> res = new ArrayList<>();
        while (!q.isEmpty()) {
            String recipe = q.remove();
            res.add(recipe);
            if (adj.containsKey(recipe)) {
                for (String dep : adj.get(recipe)) {
                    indegree.put(dep, indegree.get(dep) - 1);
                    if (indegree.get(dep) == 0) {
                        q.add(dep);
                    }
                }
            }
        }
        return res;
    }
}

This site is open source. Improve this page.