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

//****|*|*-**|*-**|---
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
using namespace std; const int maxn = + ;
string key[] = {
"*-", "-***", "-*-*", "-**",
"*", "**-*", "--*", "****",
"**", "*---", "-*-", "*-**",
"--", "-*", "---", "*--*",
"--*-","*-*", "***", "-",
"**-","***-", "*--", "-**-",
"-*--","--**"
};
char value[] = "abcdefghijklmnopqrstuvwxyz"; map<string, char> table; void solve(); void solve()
{
string line;
for (int i = ; i < ; 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 = ; 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 ;
}

很简单的题目,主要是了解c++的map容器的用法

顺便推荐一个学长的博客,整理的超级完美: http://www.jianshu.com/p/26d4d60233a4

上一篇:[知了堂学习笔记]_牵线Eclipse和Tomcat第一篇 —— 配置Java环境变量&&安装eclipse


下一篇:bzoj 1412 [ZJOI2009]狼和羊的故事(最小割)