题解 | 找位置 利用map>

#include <iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#include<cstring>
using namespace std;
int main() {
	char arr[100];
	map<char, vector<int>> timesmap;
	vector<char> firstmap;
	cin >> arr;
	int len = strlen(arr);
	for (int i = 0; i < len; i++) {
		timesmap[arr[i]].push_back(i);
		if (timesmap[arr[i]].size() == 1)
			firstmap.push_back(arr[i]);
	}
	vector<char>::iterator it1;
	vector<int>::iterator it2;
	for (it1 = firstmap.begin(); it1 != firstmap.end(); it1++) {
		vector<int> v1 = timesmap[*it1];
		int l = v1.size();
		if (l>1) {

			for (int i = 0; i < l - 1; i++) {
				cout << *it1 << ":" << v1[i] << ",";
			}
			cout << *it1 << ":" << v1[l - 1] << endl;
		}
	}
}