這是我學(xué)習(xí)數(shù)據(jù)結(jié)構(gòu)時(shí)的一道上機(jī)作業(yè)，那時(shí)還沒養(yǎng)成寫注釋的習(xí)慣，所以各位得受點(diǎn)苦了。

只是簡(jiǎn)易背包問題。

代碼：

展開 1 // 背包問題所有解 2 // 作者:王錦 3 // 郵箱:jinksw@vip.qq.com 4 5 #include "stdafx.h" 6 #include <iostream> 7 #include <stack> 8 #include <list> 9 using namespace std; 10 11 class BagProblemSolver 12 { 13 private: 14 int *stuffWeight; 15 int s; 16 int n; 17 list<list<int>*> allResultHolder;//存放所有解 18 void insertResultToList(stack<int> bagStack); 19 public: 20 BagProblemSolver(int s,int n,int *stuffWeight) 21 { 22 this->s = s; 23 this->n = n; 24 this->stuffWeight = new int[n]; 25 for(int i = 0;i < n;++i) 26 this->stuffWeight[i] = stuffWeight[i]; 27 } 28 ~BagProblemSolver() 29 { 30 delete[] stuffWeight; 31 } 32 list<list<int>*> getAllResult(); 33 }; 34 35 list<list<int>*> BagProblemSolver::getAllResult() 36 { 37 if(s <= 0) 38 return allResultHolder; 39 int currentWeight = 0; 40 stack<int> indexStack; 41 int i = 0; 42 do 43 { 44 while(currentWeight < s && i < n) 45 { 46 if(currentWeight + stuffWeight[i] <= s) 47 { 48 indexStack.push(i); 49 currentWeight += stuffWeight[i]; 50 } 51 i++; 52 } 53 if(currentWeight == s) 54 { 55 insertResultToList(indexStack); 56 i = indexStack.top(); 57 indexStack.pop(); 58 currentWeight -= stuffWeight[i]; 59 i++; 60 } 61 else if(!indexStack.empty()) 62 { 63 i = indexStack.top(); 64 indexStack.pop(); 65 currentWeight -= stuffWeight[i]; 66 i++; 67 } 68 }while(!indexStack.empty() || i < n); 69 return allResultHolder; 70 } 71 72 73 74 void BagProblemSolver::insertResultToList(stack<int> bagStack) 75 { 76 stack<int> tempStack;//用于將解以正序存入list 77 while(!bagStack.empty()) 78 { 79 tempStack.push(bagStack.top()); 80 bagStack.pop(); 81 } 82 list<int> * resultList = new list<int>(); 83 while(!tempStack.empty()) 84 { 85 resultList->push_back(stuffWeight[tempStack.top()]); 86 tempStack.pop(); 87 } 88 allResultHolder.push_back(resultList); 89 } 90 91 int _tmain(int argc, _TCHAR* argv[]) 92 { 93 cout << "請(qǐng)輸入背包可以放入的物品重量.(輸入q退出)" << endl; 94 char c; 95 cin >> c; 96 while(c != 'q') 97 { 98 cin.putback(c); 99 int s = 0; 100 cin >> s;//背包可以放入的物品重量 101 cout << "請(qǐng)輸入物品數(shù)量." << endl; 102 int n = 0;//物品數(shù)量 103 cin >> n; 104 int *stuffWeight= new int[n]; 105 cout << "請(qǐng)分別輸入" << n << "個(gè)物品重量." << endl; 106 for(int i = 0;i < n;++i) 107 cin >> stuffWeight[i]; 108 BagProblemSolver test(s,n,stuffWeight); 109 list<list<int>*> ls = test.getAllResult(); 110 cout << "背包容量(" << s << "),有(" << n << ")個(gè)物品,"; 111 cout << "質(zhì)量分別為("; 112 for(int i = 0; i < n;++i) 113 { 114 cout << stuffWeight[i]; 115 if(i != n - 1) 116 cout << ","; 117 } 118 cout << ")" << endl; 119 if(ls.empty()) 120 { 121 cout << "此問題無解!" << endl; 122 } 123 else 124 { 125 cout << "所有解為:" << endl; 126 while(!ls.empty()) 127 { 128 list<int> *temp = ls.front(); 129 ls.pop_front(); 130 while(!temp->empty()) 131 { 132 cout << temp->front() << " "; 133 temp->pop_front(); 134 } 135 cout << endl; 136 delete temp; 137 } 138 } 139 cout << "請(qǐng)輸入背包可以放入的物品重量.(輸入q退出)" << endl; 140 cin >> c; 141 } 142 }

?

?

轉(zhuǎn)載于:https://www.cnblogs.com/jinks/archive/2013/04/26/3044930.html

總結(jié)

以上是生活随笔為你收集整理的求背包问题所有解(C++实现)的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。