(JavaScript) Knapsack problem in a recursive way

unbounded_knapsack_recursive.js

function CakeType(weight, value) {
    this.weight = weight;
    this.value = value;
}

var cakeTypes = [
    new CakeType(7, 160),
    new CakeType(3, 90),
    new CakeType(2, 15),
];

function getMaxValue(types, capacity) {
	var maxValuesAtCapacities = new Array(capacity + 1);
	
	return getMaxValueAtCapacity(capacity);

	function getMaxValueAtCapacity(capacity) {
		if (capacity < 1) {
			return 0;
		}

		var maxValueAtCurrentCapapcity = 0;

		if (maxValuesAtCapacities[capacity]) {
			return maxValuesAtCapacities[capacity];
		} else {
			types.forEach(function(cake) {
				if (cake.weight <= capacity) {
					var cakeTotalValue = cake.value + getMaxValueAtCapacity(capacity - cake.weight);
					maxValueAtCurrentCapapcity = Math.max(maxValueAtCurrentCapapcity, cakeTotalValue);
				}
			});
		}
		
		//console.log(maxValueAtCurrentCapapcity);
		maxValuesAtCapacities[capacity] = maxValueAtCurrentCapapcity;
		return maxValueAtCurrentCapapcity;
	}
}

console.log(getMaxValue(cakeTypes, 20));