[Locked] Alien Dictionary
Alien Dictionary
There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of words from the dictionary, where words are sorted lexicographically by the rules of this new language. Derive the order of letters in this language.
For example, Given the following words in dictionary,
[
"wrt",
"wrf",
"er",
"ett",
"rftt"
]
The correct order is: "wertf"
.
Note: You may assume all letters are in lowercase. If the order is invalid, return an empty string. There may be multiple valid order of letters, return any one of them is fine.
分析:
前后关系可看做是一种偏序关系,对于每个序列,可以看成是有向图,所有序列合在一起就成了一个大的有向图,本题可转换成有向图的拓扑排序,用BFS可解决。主要过程包含:1、根据string数组的信息映射成图;2、在图上计算出所有节点的入度;3、进行BFS,得到拓扑排序结果。故我用三个子函数来分别处理这三个过程。
代码:
//将string数组映射到图上,最坏时间复杂度就是每个字母遍历一遍,这也是必要,故也是最低时间复杂度
unordered_multimap<char, char> mapping(vector<string> &vs) {
//先处理第一列,用validcomp来记录哪些相邻行的值相等,用于后面的列的处理,不相等的就可以得偏序条件,用边来表示,存入edges中;然后处理第二列,以此类推。
unordered_multimap<char, char> edges;
unordered_set<int> validcomp, temp;
for(int i = ; i < vs.size(); i++)
validcomp.insert(i);
int j = ;
while(!validcomp.empty()) {
for(int pos : validcomp) {
if(vs[pos][j] != vs[pos - ][j])
edges.insert(make_pair(vs[pos - ][j], vs[pos][j]));
else
temp.insert(pos);
}
unordered_set<int> ().swap(validcomp);
validcomp.swap(temp);
j++;
}
return edges;
} //返回所有节点的入度,存入degree里
unordered_map<char, int> getDegree(unordered_multimap<char, char> &edges) {
unordered_map<char, int> degree;
for(char c = 'a'; c <= 'z'; c++) {
auto range = edges.equal_range(c);
auto pos = range.first;
while(pos != range.second) {
//指出节点未出现过,则设0,否则跳过;指入节点未出现过,则设1,否则++。
if(degree.find(pos->first) == degree.end())
degree[pos->first] = ;
if(degree.find(pos->second) != degree.end())
degree[pos->second]++;
else
degree[pos->second] = ;
pos++;
}
}
return degree;
} //进行BFS,用最朴素的方法,复杂度为O(N^2),用这个方法找到符合题目要求的顺序,如果能遍历完全所有节点,则return这个顺序;否则,return ""
bool bfs(string &str, unordered_map<char, int> degree, unordered_multimap<char, char> &edges) {
bool visited[];
memset(visited, , );
for(int i = ; i < degree.size(); i++) {
for(auto m : degree)
//入度为0则排入,然后更新入度hash表
if(!visited[int(m.first - 'a')] && m.second == ) {
visited[int(m.first - 'a')] = true;
str += m.first;
auto range = edges.equal_range(m.first);
auto pos = range.first;
while(pos != range.second) {
degree[pos->second]--;
pos++;
}
break;
}
}
//有环,则return ""
for(auto m : degree)
if(m.second != )
return false;
return true;
}
//主函数
string validOrder(vector<string> vs) {
//string数组映射到图edges上
unordered_multimap<char, char> edges = mapping(vs);
//返回所有节点的入度,存入degree;如果无效,则return "";
unordered_map<char, int> degree = getDegree(edges);
//进行BFS,找到合适的顺序,优先排入入度为0的点
string str = "";
bool valid = bfs(str, degree, edges);
return valid ? str : "";
}
其中,BFS过程,即函数bfs复杂度为O(N^2),N为节点个数,有改进的空间;可以优化为O(E),E为边的个数
//优化BFS
bool bfs(string &str, unordered_map<char, int> degree, unordered_multimap<char, char> &edges) {
queue<char> myq, temp;
for(auto m : degree)
if(m.second == )
myq.push(m.first);
while(!myq.empty()) {
while(!myq.empty()) {
char c = myq.front();
str += c;
myq.pop();
auto range = edges.equal_range(c);
auto pos = range.first;
while(pos != range.second) {
degree[pos->second]--;
if(degree[pos->second] == )
temp.push(pos->second);
pos++;
}
}
queue<char> ().swap(myq);
myq.swap(temp);
}
//有环,则return ""
for(auto m : degree)
if(m.second != )
return false;
return true;
}
[Locked] Alien Dictionary的更多相关文章
- 【Leetcode_easy】953. Verifying an Alien Dictionary
problem 953. Verifying an Alien Dictionary solution: class Solution { public: bool isAlienSorted(vec ...
- Verifying an Alien Dictionary
2019-11-24 22:11:30 953. Verifying an Alien Dictionary 问题描述: 问题求解: 这种问题有一种解法是建立新的排序和abc排序的映射,将这里的str ...
- [LeetCode] Alien Dictionary 另类字典
There is a new alien language which uses the latin alphabet. However, the order among letters are un ...
- 269. Alien Dictionary 另类字典 *HARD*
There is a new alien language which uses the latin alphabet. However, the order among letters are un ...
- Alien Dictionary
There is a new alien language which uses the latin alphabet. However, the order among letters are un ...
- LeetCode Alien Dictionary
原题链接在这里:https://leetcode.com/problems/alien-dictionary/ 题目: There is a new alien language which uses ...
- Leetcode: Alien Dictionary && Summary: Topological Sort
There is a new alien language which uses the latin alphabet. However, the order among letters are un ...
- 269. Alien Dictionary
题目: There is a new alien language which uses the latin alphabet. However, the order among letters ar ...
- [Swift]LeetCode269. 外星人词典 $ Alien Dictionary
There is a new alien language which uses the latin alphabet. However, the order among letters are un ...
随机推荐
- java 反射调用支付SDK
在android开发中会遇到各种SDK的接入,很是麻烦.最初在想能不能把所有的SDK都 融合到一个当中,发现有点异想天开.但是也可以解决SDK资源不小心没有引入,导致程序调用接口崩溃问题.经过查资料, ...
- if 和 swith的选择.
具体数值不多,而是符合byte short int char这四种类型,建议使用swtich语句.因为效率稍高. 其他情况:对区间判断,对结果为boolean类型判断,使用if,if的使用范围更广.
- 替换 wcf 消息传输中的 命名空间
替换 wcf 消息传输中的 命名空间,http://vanacosmin.ro/Articles/Read/WCFEnvelopeNamespacePrefix
- Deep Learning 学习随记(五)深度网络--续
前面记到了深度网络这一章.当时觉得练习应该挺简单的,用不了多少时间,结果训练时间真够长的...途中debug的时候还手贱的clear了一下,又得从头开始运行.不过最终还是调试成功了,sigh~ 前一篇 ...
- 添加Pods后,import无提示的解决办法
选择工程的 Target -> Build Settings 菜单,找到\”User Header Search Paths\”设置项 新增一个值"$(PODS_ROOT)" ...
- 『重构--改善既有代码的设计』读书笔记----Self Encapsulate Field
如果你直接访问一个字段,你就会和这个字段直接的耦合关系变得笨拙.也就是说当这个字段权限更改,或者名称更改之后你的客户端代码都需要做相应的改变,此时你可以为这个字段建立设值和取值函数并且只以这些函数来访 ...
- 用jQuery实现瀑布流效果学习笔记
jQuery一直没系统的学,只知道是js库,封装了好多js函数,方便了开发.以前做过一个原生的图片网站瀑布流效果,超级麻烦,这次用了jQuery方法,瞬间代码浓缩了,只有56行js代码.神奇的让我来把 ...
- 入门4:PHP 语法基础1
一.PHP标记符 1.PHP页面中 以<?php 开头, ?>结尾,纯PHP页面结尾可以不写?> 2.在HTML页面插入PHP代码,必须有?>结尾.代码如下: <!DO ...
- Python元组、列表、字典
```python>>> help(tuple) Help on class tuple in module __builtin__: class tuple(object) │ t ...
- HDU 1069 Monkey and Banana(LIS最长上升子序列)
B - LIS Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Descripti ...