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.
[分析]
先由输入构造出一张有向图,图的节点是字符,边指示字符顺序。考察相邻两字符串的每个字符来构造全图。假设当前考察的字符是c1, c2(c1是前面单词某位置的字符,c2是后面单词同位置处的字符),若c1和c2不等,则在图中加入一条c1指向c2的边。
然后进行拓扑排序,并记录拓扑排序依次遍历到的字符,若排序后所得字符和图中节点数一致说明该图无圈,也即给定的字典合法,拓扑排序所得结果即为字典规则。
public class Solution {
public String alienOrder(String[] words) {
if (words == null || words.length == 0)
return "";
if (words.length == 1)
return words[0];
Map<Character, Set<Character>> graph = buildGraph(words);
Map<Character, Integer> indegree = computeIndegree(graph);
StringBuilder order = new StringBuilder();
LinkedList<Character> queue = new LinkedList<Character>();
for (Character c : indegree.keySet()) {
if (indegree.get(c) == 0)
queue.offer(c);
}
while (!queue.isEmpty()) {
char c = queue.poll();
order.append(c);
for (Character adj : graph.get(c)) {
if (indegree.get(adj) - 1 == 0)
queue.offer(adj);
else
indegree.put(adj, indegree.get(adj) - 1);
}
}
return order.length() == indegree.size() ? order.toString() : "";
}
public Map<Character, Set<Character>> buildGraph(String[] words) {
Map<Character, Set<Character>> map = new HashMap<Character, Set<Character>>();
int N = words.length;
for (int i = 1; i < N; i++) {
String word1 = words[i - 1];
String word2 = words[i];
int len1 = word1.length(), len2 = word2.length(), maxLen = Math.max(len1, len2);
boolean found = false;
for (int j = 0; j < maxLen; j++) {
char c1 = j < len1 ? word1.charAt(j) : ' ';
char c2 = j < len2 ? word2.charAt(j) : ' ';
if (c1 != ' ' && !map.containsKey(c1))
map.put(c1, new HashSet<Character>());
if (c2 != ' ' && !map.containsKey(c2))
map.put(c2, new HashSet<Character>());
if (c1 != ' ' && c2 != ' ' && c1 != c2 && !found) {
map.get(c1).add(c2);
found = true;
}
}
}
return map;
}
public Map<Character, Integer> computeIndegree(Map<Character, Set<Character>> graph) {
Map<Character, Integer> indegree = new HashMap<Character, Integer>();
for (Character prev : graph.keySet()) {
if (!indegree.containsKey(prev))
indegree.put(prev, 0);
for (Character succ : graph.get(prev)) {
if (!indegree.containsKey(succ))
indegree.put(succ, 1);
else
indegree.put(succ, indegree.get(succ) + 1);
}
}
return indegree;
}
}
分享到:
相关推荐
《leetcode-solutions》,刷算法题,需要有一定的英文阅读能力。。。
Algorithm-LeetCode-Sol-Res.zip,干净,易懂的解决方案和资源,为leetcode在线判断算法问题。,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
IDEA 插件,lettcode刷题,leetcode-editor7.4版本下载进行本地导入(直接将压缩包拖进IDEA即可)
Algorithm-leetcode-spider.zip,leetcode公司,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
在IDE中解决LeetCode问题,支持leetcode.com与leetcode-cn.com,满足基本的做题需求。 理论上支持: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio。
leetcode-cli-plugins leetcode-cli 的第 3 方插件。 什么是 如何使用 如何使用 插件 名称 描述 增强的命令 按公司或标签过滤问题 list 不要在同一台计算机上使 Chrome 的会话过期 login 不要在同一台计算机上使 ...
解题思路思路和LeetCode-python 503.下一个更大元素 II一致,只是这里求的是下标的距离,而不是数值倒序搜索,用到栈,栈里存储索引情况1:若栈为
leetcode-cheat 的发布 它是什么 ? 这是一个chrome 扩展,可以帮助您更高效地使用 leetcode。您可以从 重要: leetcode-cheat 现在只支持中文版。 也就是说不完全支持leetcode.com,但是你可以用leetcode-cn.com代替...
leetcode 答案解析 golang解答
leetcode-editor,在ide中做leetcode练习,支持leetcode.com和leetcode-cn.com,以满足练习的基本需求。理论上支持:intellij idea phpstorm webstorm pycharm rubymine appcode clion goland datagrip rider mps ...
~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/vsc-leetcode-cli/bin/leetcode /usr/local/bin/leetcode 修改模板 open ~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/...
leetcode-helper-1.7.1
然后进入到LeetCode-Spider目录中修改config.json,其中outputDir需要填写该工程的/docs/views文件夹路径 { "username": "aaa", "password": "bbb", "outputDir": "/Users/liuyao/Downloads/LeetCode-Blog-Test/docs...
leetcode-tag-dynamic programming
leetcode-cli 注意:这个存储库是为了临时使用而分叉的。 注意:从 webbrowser 复制 cookie 并使用leetcode user -c可以临时修复不能。 一个享受 leetcode 的高效 cli 工具! 非常感谢 leetcode.com,一个非常棒的...
leetcode-tag-Tree
leetcode-tag-Stack
leetcode-tag-array
Algorithm-LeetCode-Solution-From-GuaZiDou.zip,Leetcode解决方案Gitbook,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。