求背包问题所有解(C++实现)

这是我学习数据结构时的一道上机作业，那时还没养成写注释的习惯，所以各位得受点苦了。

只是简易背包问题。

代码：

// 背包问题所有解
// 作者:王锦 
// 邮箱:jinksw@vip.qq.com

#include "stdafx.h"
#include <iostream>
#include <stack>
#include <list>
using namespace std;

class BagProblemSolver
{
private:
    int *stuffWeight;
    int s;
    int n;
    list<list<int>*> allResultHolder;//存放所有解
    void insertResultToList(stack<int> bagStack);
public:
    BagProblemSolver(int s,int n,int *stuffWeight)
    {
        this->s = s;
        this->n = n;
        this->stuffWeight = new int[n];
        for(int i = 0;i < n;++i)
            this->stuffWeight[i] = stuffWeight[i];
    }
    ~BagProblemSolver()
    {
        delete[] stuffWeight;
    }
    list<list<int>*> getAllResult();
};

list<list<int>*> BagProblemSolver::getAllResult()
{
    if(s <= 0)
        return allResultHolder;
    int currentWeight = 0;
    stack<int> indexStack;
    int i = 0;
    do
    {
        while(currentWeight < s && i < n)
        {
            if(currentWeight + stuffWeight[i] <= s)
            {
                indexStack.push(i);
                currentWeight += stuffWeight[i];
            }
            i++;
        }
        if(currentWeight == s)
        {
            insertResultToList(indexStack);
            i = indexStack.top();
            indexStack.pop();
            currentWeight -= stuffWeight[i];
            i++;
        }
        else if(!indexStack.empty())
        {
            i = indexStack.top();
            indexStack.pop();
            currentWeight -= stuffWeight[i];
            i++;
        }
    }while(!indexStack.empty() || i < n);
    return allResultHolder;
}



void BagProblemSolver::insertResultToList(stack<int> bagStack)
{
    stack<int> tempStack;//用于将解以正序存入list
    while(!bagStack.empty())
    {
        tempStack.push(bagStack.top());
        bagStack.pop();
    }
    list<int> * resultList = new list<int>();
    while(!tempStack.empty())
    {
        resultList->push_back(stuffWeight[tempStack.top()]);
        tempStack.pop();
    }
    allResultHolder.push_back(resultList);
}

int _tmain(int argc, _TCHAR* argv[])
{
    cout << "请输入背包可以放入的物品重量.(输入q退出)" << endl;
    char c;
    cin >> c;
    while(c != 'q')
    {
        cin.putback(c);
        int s = 0;
        cin >> s;//背包可以放入的物品重量
        cout << "请输入物品数量." << endl;
        int n = 0;//物品数量
        cin >> n;
        int *stuffWeight= new int[n];
        cout << "请分别输入" << n << "个物品重量." << endl;
        for(int i = 0;i < n;++i)
            cin >> stuffWeight[i];
        BagProblemSolver test(s,n,stuffWeight);
        list<list<int>*> ls = test.getAllResult();
        cout << "背包容量(" << s << "),有(" << n << ")个物品,";
        cout << "质量分别为(";
        for(int i = 0; i < n;++i)
        {
            cout << stuffWeight[i];
            if(i != n - 1)
                cout << ",";
        }    
        cout << ")" << endl;
        if(ls.empty())
        {
            cout << "此问题无解!" << endl;
        }
        else
        {
            cout << "所有解为:" << endl;
            while(!ls.empty())
            {
                list<int> *temp = ls.front();
                ls.pop_front();
                while(!temp->empty())
                {
                    cout << temp->front() << " ";
                    temp->pop_front();
                }
                cout << endl;
                delete temp;
            }
        }
        cout << "请输入背包可以放入的物品重量.(输入q退出)" << endl;
        cin >> c;
    }
}