bottomUpPizzas.java

    public void decideThree() {
        int slizes = slices.size();
        List<Integer>[] adjList = new List[slizes];

        for (int i = 0; i < slizes; ++i) {
            adjList[i] = new ArrayList<>();
        }

        boolean[] done = new boolean[maxPizzas + 1];
        done[0] = true;
        for (int i = 1; i <= maxPizzas; ++i) {
            for (int j = 0; j < slices.size(); ++j) {
                if (i - slices.get(j) < 0) continue;
                if (done[i - slices.get(j)]) {
                    int count = freqMap.get(slices.get(j));
                    if (count <= 0) continue;
                    adjList[j].add(i);
                    freqMap.put(slices.get(j), count - 1);
                    done[i] = true;
                    break;
                }

            }
        }

        int maxAtt = 0;
  //look for everywhere in adjList that has that maxValue?
        //adjlist here is a list of all values that this slice can make
        for (int i = maxPizzas; i >= 0; --i) {
            if (done[i]) {
               maxAtt = i;
                break;
            }
        }

        for(int i = 0; i<slizes; ++i) {
            List<Integer> currList = adjList[i];
            for(int el : currList) {
                if(el == maxAtt) {
                   solution.add(i);
                }
            }
        }