博客
关于我
W2 - Ananagrams
阅读量:692 次
发布时间:2019-03-15

本文共 3042 字,大约阅读时间需要 10 分钟。

题目描述

Most crossword puzzle fans are used to anagrams — groups of words with the same letters in different

orders — for example OPTS, SPOT, STOP, POTS and POST. Some words however do not have this
attribute, no matter how you rearrange their letters, you cannot form another word. Such words are
called ananagrams, an example is QUIZ.
Obviously such definitions depend on the domain within which we are working; you might think
that ATHENE is an ananagram, whereas any chemist would quickly produce ETHANE. One possible
domain would be the entire English language, but this could lead to some problems. One could restrict
the domain to, say, Music, in which case SCALE becomes a relative ananagram (LACES is not in the
same domain) but NOTE is not since it can produce TONE.
Write a program that will read in the dictionary of a restricted domain and determine the relative
ananagrams. Note that single letter words are, ipso facto, relative ananagrams since they cannot be
“rearranged” at all. The dictionary will contain no more than 1000 words.

Input

Input will consist of a series of lines. No line will be more than 80 characters long, but may contain any

number of words. Words consist of up to 20 upper and/or lower case letters, and will not be broken
across lines. Spaces may appear freely around words, and at least one space separates multiple words
on the same line. Note that words that contain the same letters but of differing case are considered to
be anagrams of each other, thus ‘tIeD’ and ‘EdiT’ are anagrams. The file will be terminated by a line
consisting of a single ‘#’.

Output

Output will consist of a series of lines. Each line will consist of a single word that is a relative ananagram

in the input dictionary. Words must be output in lexicographic (case-sensitive) order. There will always
be at least one relative ananagram.

Sample Input

ladder came tape soon leader acme RIDE lone Dreis peat

ScAlE orb eye Rides dealer NotE derail LaCeS drIed
noel dire Disk mace Rob dries

Sample Output

Disk

NotE
derail
drIed
eye
ladder
soon

分析

我的思路是用一个map容器,把字符串转为小写而且字符间排序作为键值,把出现次数和源字符串组成pair存为值。将map的键值对存入vector容器并按照源字符串排序,遍历vector,若出现次数为1次则输出源字符串。

Code

/* * @Description: Ananagrams * @version: * @Author: * @Date: 2021-04-08 09:41:45 * @LastEditors: Please set LastEditors * @LastEditTime: 2021-04-08 11:38:52 */// self#include 
#include
#include
#include
#include
using namespace std;map
> lowercase;string toLower(string str){ for (int i = 0; i < str.length(); i++) str[i] = tolower(str[i]); return str;}bool cmp(pair
> a, pair
> b){ return a.second.second < b.second.second;}int main(void){ ios::sync_with_stdio(false); cin.tie(0); string str; while (cin >> str && str[0] != '#') { string raw = str; str = toLower(str); sort(str.begin(), str.end()); if (lowercase.find(str) == lowercase.end()) lowercase[str] = make_pair(1, raw); else lowercase[str].first++; } vector
>> temp(lowercase.begin(), lowercase.end()); sort(temp.begin(), temp.end(), cmp); for (int i=0;i

转载地址:http://pjwqz.baihongyu.com/

你可能感兴趣的文章
MySQL 中随机抽样:order by rand limit 的替代方案
查看>>
MySQL 为什么需要两阶段提交?
查看>>
mysql 为某个字段的值加前缀、去掉前缀
查看>>
mysql 主从 lock_mysql 主从同步权限mysql 行锁的实现
查看>>
mysql 主从互备份_mysql互为主从实战设置详解及自动化备份(Centos7.2)
查看>>
mysql 主键重复则覆盖_数据库主键不能重复
查看>>
Mysql 优化 or
查看>>
mysql 优化器 key_mysql – 选择*和查询优化器
查看>>
MySQL 优化:Explain 执行计划详解
查看>>
Mysql 会导致锁表的语法
查看>>
mysql 使用sql文件恢复数据库
查看>>
mysql 修改默认字符集为utf8
查看>>
Mysql 共享锁
查看>>
MySQL 内核深度优化
查看>>
mysql 内连接、自然连接、外连接的区别
查看>>
mysql 写入慢优化
查看>>
mysql 分组统计SQL语句
查看>>
Mysql 分页
查看>>
Mysql 分页语句 Limit原理
查看>>
MySQL 创建新用户及授予权限的完整流程
查看>>