Unbounded Knapsack Problem

// Given an array of objects with a value and weight, figure out the combo to fit in your knapsack with the highest value
// There is an unlimited ammount of each object

public class Solution{
  public class Item{
    int value;
    int weight;
    public Item(int value, int weight){
      this.value = value;
      this.weight = weight;
    }
  }
  
  public static int unboundedKnapsack(Item[] items, int capacity){
    int[] capacities = new int[capacity + 1];
    int maxSoFar = 0;
    
    for(int currentCapacity = 0; currentCapacity < capacities; currentCapacity++){
      int maxValue = 0;
      for(Item item : items){
        if(item.weight <= currentCapacity){
          int weightDifference = currentCapacity - item.weight;
          maxValue = Math.max(maxCapacity, (item.value + capacities[weightDifference]);
        }
      }
      maxSoFar = Math.max(maxSoFar, maxValue);
    }
    
    return capacities[capacity];
  }
}