269. 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, wherewords 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.
链接: http://leetcode.com/problems/alien-dictionary/
题解:
这道题也是卡了很久,原因在于题意理解不明确。方法还是Topological Sorting,这题的意思是 - Words are sorted, 跟每个Word里面的letter顺序并没有什么关系。就比如"apple"排在"banana"前面,但并不是"apple"里面的"a"就排在"p"前面。所以之前花了不少时间根据每个单词内部的顺序构造edges,结果都是错的。 这种东西归根结底还是我自己的英语不好。写了一大堆总是通不过,发现题目真正含义以后就好很多了,以后面试的话也要多交流多沟通,免得题意弄不清楚白浪费时间做题。另外,对于图来说,图的三种表达方式, list of edges, ajacency matrix和ajacency lists一定要搞清楚,多弄明白。
Kahn's Algorithm: 先把输入words转化为Adjacency Lists或者list of edges,然后使用Course Schedule II的方法进行Topological Sorting。这里我们使用Kahn's Algorithm,先计算inDegree,然后维护一个Queue来进行BFS。
Time Complexity - O(VE),Space Complexity - O(VE)
public class Solution {
public String alienOrder(String[] words) { // Topological sorting - Kahn's Algorithm
if(words == null || words.length == 0) {
return "";
} Map<Character, HashSet<Character>> map = new HashMap<>();
Map<Character, Integer> inDegree = new HashMap<>(); for(String s : words) {
for(int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
inDegree.put(c, 0);
}
} for(int i = 1; i < words.length; i++) { // find (prevChar, curChar) pairs as edges
String prevStr = words[i - 1];
String curStr = words[i];
int len = Math.min(prevStr.length(), curStr.length());
for(int j = 0; j < len; j++) {
char curChar = curStr.charAt(j);
char prevChar = prevStr.charAt(j);
if(curChar == prevChar) {
continue;
} else { // find edges;
if(map.containsKey(prevChar)) {
if(!map.get(prevChar).contains(curChar)) {
map.get(prevChar).add(curChar);
inDegree.put(curChar, inDegree.get(curChar) + 1);
}
} else {
HashSet<Character> tmpSet = new HashSet<>();
tmpSet.add(curChar);
map.put(prevChar, tmpSet);
inDegree.put(curChar, inDegree.get(curChar) + 1);
}
break;
}
}
} Queue<Character> queue = new LinkedList<>();
for(char c : inDegree.keySet()) {
if(inDegree.get(c) == 0) {
queue.offer(c);
}
} StringBuilder res = new StringBuilder();
while(!queue.isEmpty()) {
char c = queue.poll();
res.append(c);
if(map.containsKey(c)) {
for(char l : map.get(c)) {
inDegree.put(l, inDegree.get(l) - 1);
if(inDegree.get(l) == 0) {
queue.offer(l);
}
}
}
} if(res.length() != inDegree.size()) {
return "";
} return res.toString();
}
}
题外话:
这几天食物过于丰富。周五BCD豆腐,周六刘一手火锅(改名了),周日又去了法拉盛吃老周全羊馆,结果就懈怠了。不过和小伙伴们玩玩三国杀放松一下也是很好的。房子的装修也接近尾声,明天周一估计就可以收工了,希望一切顺利。 同时,明天也开始为期一周的培训,主要是Modern Web Development,讲JavaScript的。同时Coursera也有一门讲AngularJS的课程,香港科技大学开设的,明天开始第一天。要趁这个机会好好学一些AngularJS。
二刷:
简化了一下。思路不那么乱了。有几个特殊的点要注意:
- 输入中只含有26个小写字母,所以我们可以可以用一个int[26]来计算inDegree
- 输出的时候只输出在words里出现过的字符,所以先把字符保存在一个set里。 其实这里也可以和map一起遍历,但需要不少额外的边界条件
- 注意单词内部的顺序没有关系,只有单词和前一个单词相同位置不同字间才有先后顺序。
- 要注意图的adjancency lists表示结构, 使用Map<Character, Set<Character>>可能会比 Map<Character, List<Character>>快。同时要注意这道题里key保存的是先输出的字符,value里面保存的是后输出的字符。inDegree里也是后输出字符的value被增加
- 结尾的时候假如sb.length() < set.size(),说明无法组成一个topological order,我们返回"",否则返回一个topological sorted string sb.toString();
Java:
public class Solution {
public String alienOrder(String[] words) { // Topological sorting - Kahn's Algorithm
if(words == null || words.length == 0) {
return "";
}
Map<Character, Set<Character>> graph = new HashMap<>();
Set<Character> set = new HashSet<>();
for (String word : words) {
for (int i = 0; i < word.length(); i++) {
set.add(word.charAt(i));
}
} int[] inDegree = new int[26];
for (int k = 1; k < words.length; k++) {
String preStr = words[k - 1];
String curStr = words[k];
for (int i = 0; i < Math.min(preStr.length(), curStr.length()); i++) {
char preChar = preStr.charAt(i);
char curChar = curStr.charAt(i);
if (preChar != curChar) {
if (!graph.containsKey(preChar)) {
graph.put(preChar, new HashSet<Character>());
}
if (!graph.get(preChar).contains(curChar)) {
inDegree[curChar - 'a']++;
}
graph.get(preChar).add(curChar);
break;
}
}
}
Queue<Character> queue = new LinkedList<>();
for (int i = 0; i < inDegree.length; i++) {
if (inDegree[i] == 0) {
char c = (char)('a' + i);
if (set.contains(c)) {
queue.offer(c);
}
}
}
StringBuilder sb = new StringBuilder();
while (!queue.isEmpty()) {
char c = queue.poll();
sb.append(c);
if (graph.containsKey(c)) {
for (char l : graph.get(c)) {
inDegree[l - 'a']--;
if (inDegree[l - 'a'] == 0) {
queue.offer(l);
}
}
}
}
return sb.length() != set.size() ? "" : sb.toString();
}
}
Reference:
https://leetcode.com/discuss/53997/the-description-is-wrong
https://leetcode.com/discuss/71991/8ms-clean-java-using-topological-sort-and-dfs
https://leetcode.com/discuss/65274/java-solution-basic-topological-sort
https://leetcode.com/discuss/69894/fastest-java-solution-topological-comments-improvements
https://leetcode.com/discuss/54002/simple-idea-based-on-dfs-4ms-in-c
https://leetcode.com/discuss/54549/java-toposort-solution-clean
https://leetcode.com/discuss/54188/16-18-lines-python-29-lines-c
269. Alien Dictionary的更多相关文章
- [LeetCode] 269. 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 ...
- [leetcode]269. Alien Dictionary外星字典
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 ...
- [LeetCode] 269. Alien Dictionary 外文字典
There is a new alien language which uses the latin alphabet. However, the order among letters are un ...
- LeetCode 269. Alien Dictionary
原题链接在这里:https://leetcode.com/problems/alien-dictionary/ 题目: There is a new alien language which uses ...
- [Locked] Alien Dictionary
Alien Dictionary There is a new alien language which uses the latin alphabet. However, the order amo ...
- 【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 ...
随机推荐
- vtune 不能查看pg的源代码
在编译的时候,要加enable-debug 选项 并且如果之前有没有加的话,一定要make clean
- Java基础学习总结--Java对象的序列化和反序列化
一.序列化和反序列化的概念 把对象转换成字节序列的过程称之为对象的序列化 把字节序列恢复为对象的过程称之为对象的反序列化 对象序列化的主要用途: 1)把对象的字节序列永久的保存到硬盘上,通常放在一个文 ...
- Excel下用SQL语句实现AVEDEV函数功能
Excel下AVEDEV函数返回一组数据点到其算术平均值的绝对偏差的平均值. AVEDEV 是对一组数据中变化性的度量.最常见的应用就是统计平均分差. 但是如果在Excel中写SQL进行一些复杂的统计 ...
- Python 获取学校图书馆OAPC账号对应的身份证号码
import urllib.request import urllib.parse import http.cookiejar import re lib_login = 'http://xxx.ed ...
- sql语句not in判断条件注意事项
sql语句not in判断条件注意事项 问题描述:mysql数据库,存在两个表org表和kdorg表,用于存储组织信息.现在我需要从org表找出组织,条件为该组织不在kdorg表里. sql语句:se ...
- MySQL基本概念
MySQL 数据库 MySQL可分为三个层次:文件层次,服务层次,界面 常用的数据类型:int 整数float double decimal ——小数(要在十进位栏里设置小数点后最大显示位数)varc ...
- 我是IT小小鸟,老师我之前上传了!!!!老是请您看到我
我是IT小小鸟读后感 世界上没有一蹴而就的成功者,只有头悬梁锥刺股的奋斗者.蜉蝣向往大鹏的辉煌,却不曾知大鹏以往的汗水.蜉蝣之所以为蜉蝣,是因为它犹如井底之蛙,目光短浅,之盲目地羡慕成功者,而大鹏之所 ...
- SQL Server 2008 R2评估期已过的解决办法
SQL Server 2008 R2评估期已过的解决办法 发现问题 北美产品测试服每日随机任务没有刷新 每日随机任务是使用数据库作业定期执行操作,重置玩家随机任务项 排查问题 www.2cto. ...
- IE6 IE7 IE8(Q) 不支持 JSON 对象
标准参考 JSON 是一种数据交换格式,RFC 4627 对 JSON 进行了详细描述. 根据 ECMA-262(ECMAScript)第 5 版中描述,JSON 是一个包含了函数 parse 和 s ...
- c3p0 --1
# # This file is detritus from various testing attempts # the values below may change, and often do ...