题解 | #找位置#

#include<iostream>
#include<vector>
#include<unordered_map>
using namespace std;

//习题3.7 找位置
int main()
{
	unordered_map<char, vector<int>> maps;
	vector<char> keys;
	string s;
	while (cin >> s) {
		for (int i = 0; i < s.size(); i++) {
			if (maps.find(s[i]) == maps.end()) {
				keys.push_back(s[i]);
				maps[s[i]] = vector<int>{ i };
			}
			else {
				maps[s[i]].push_back(i);
			}
		}

		for (int i = 0; i < keys.size(); i++) {
			if (maps[keys[i]].size() < 2) {
				continue;
			}
			cout << keys[i] << ":" << maps[keys[i]][0];
			for (int j = 1; j < maps[keys[i]].size(); j++) {
				cout << "," << keys[i] << ":" << maps[keys[i]][j];
			}
			cout << endl;
		}
	}

	return 0;
}