算法C++ 背包类似集合数据类型处理弹珠处理（第一章）-白红宇

算法C++ 背包类似集合数据类型处理弹珠处理（第一章）

阅读量：216 次

发布时间：2019-02-28

本文共 882 字，大约阅读时间需要 2 分钟。

造轮子博客链接

代码实现

```cpp #include

#include

using namespace std;

int main() {

int temp, numbers;

string colours[] = { "red", "blue", "green", "black", "pink", "yellow", "grey" };

set

s_marbles;

vector

marbles;

cout << "red-0 blue-1 green-2 black-3 pink-4 yellow-5 grey-6 else colours-else numbers" << endl;  cout << "input your marbles bags: -1 stop input" << endl;  while (cin >> temp) {      if (temp == -1) break;      marbles.push_back(temp);      s_marbles.insert(temp);  }  numbers = marbles.size();  for (const auto& tmp : s_marbles) {      if (tmp >= 0 && tmp < 7) {          int tempnumbers = count(marbles.begin(), marbles.end(), tmp);          cout << colours[tmp] << ":" << tempnumbers << endl;      } else {          cout << "others" << ":" << numbers << endl;      }  }

}