题目:
解法一:
public int maximumValue(int capacity,List<Item> items) {
return IntStream.range(0, items.size())
.filter(i -> items.get(i).getWeight() <= capacity)
.map(i -> items.get(i).getValue()
+ this.maximumValue(capacity - items.get(i).getWeight(), items.subList(i + 1, items.size())))
.max()
.orElse(0);
}