Пит, пекарь

[admin]

Задачу несмог решить, потому что не понял логики. Пришлось открывать решение, изучать.
Оказывается))), даны две мапы (невнимательность моя). Первая: что требуется (рецепт), а вторая что есть.

Условие:
Pete likes to bake some cakes. He has some recipes and ingredients. Unfortunately he is not good in maths. Can you help him to find out, how many cakes he could bake considering his recipes?

Write a function cakes(), which takes the recipe (object) and the available ingredients (also an object) and returns the maximum number of cakes Pete can bake (integer). For simplicity there are no units for the amounts (e.g. 1 lb of flour or 200 g of sugar are simply 1 or 200). Ingredients that are not present in the objects, can be considered as 0.

// must return 2
cakes({flour: 500, sugar: 200, eggs: 1}, {flour: 1200, sugar: 1200, eggs: 5, milk: 200});
// must return 0
cakes({apples: 3, flour: 300, sugar: 150, milk: 100, oil: 100}, {sugar: 500, flour: 2000, milk: 2000});

 

[admin]

func Cakes(recipe, available map[string]int) int {
  for k, v := range recipe {
    available[k] -= v
    if 0 > available[k] {
      return 0
    }
  }
  return 1 + Cakes(recipe, available)
}

 

[admin]

import "math"

func Cakes(recipe, available map[string]int) int {
 cakes := math.MaxInt
    for key, value := range recipe {
        if item, ok := available[key]; !ok || item < value {
            return 0
        } else if item/value < cakes {
            cakes = item / value
        }
    }
    return cakes
}

 

[admin]

func Cakes(recipe, available map[string]int) int {
    cook := []int{}
    for k, v := range recipe {
        exist, ok := available[k]
        if ok {
            cook = append(cook, exist/v)
        } else {
            cook = append(cook, 0)
        }

    }
    return minimum(cook)
}

func minimum(values []int) int {
    min := values[0]
    for _, value := range values {
        if value <= min {
            min = value
        }
    }
    return min
}