蓝桥杯 算法提高 9-3摩尔斯电码 _c++ Map容器用法

//****|*|*-**|*-**|---
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
using namespace std;

const int maxn = 26 + 10;
string key[] = {
"*-", "-***", "-*-*", "-**",
"*",  "**-*", "--*",  "****",
"**", "*---", "-*-",  "*-**",
"--", "-*",   "---",  "*--*",
"--*-","*-*", "***",  "-",
"**-","***-", "*--",  "-**-",
"-*--","--**"
};
char value[] = "abcdefghijklmnopqrstuvwxyz";

map<string, char> table;

void solve();

void solve()
{
string line;
for (int i = 0; i < 26; i++) {
table.insert(make_pair(key[i], value[i]));
}
//    for (const auto &e : table) {       //遍历table, c++11
//        cout << e.first << " " << e.second << endl;
//    }
string t = "";
cin >> line;
for (unsigned i = 0; i < line.size(); i++) {
if (line[i] != '|') {
t += line[i];
} else {
printf("%c", table[t]);
t = "";
}
}
printf("%c\n", table[t]);
}

int main()
{
solve();
return 0;
}