LeetCode 题解(237) : Alien Dictionary

最新推荐文章于 2024-09-22 04:59:47 发布

PointbreakLALALA

最新推荐文章于 2024-09-22 04:59:47 发布

阅读量5k

点赞数

分类专栏：算法文章标签： algorithm leetcode 面试题

本文链接：https://blog.csdn.net/pointbreak1/article/details/48761705

版权

这道LeetCode题目要求根据拉丁字母构成的外星语字典，推断字母的正确排序。通过将单词转换为字符列表并进行拓扑排序，递归解决该问题，注意要检查是否存在环。C++实现提供了解决方案。

摘要由CSDN通过智能技术生成

题目：

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.

题解：

先转换为char -> list(char) 的哈希。然后就是一个topological sort的问题。用递归解决。同时要注意存在环的问题。最后把未用过的字母加入排序后的字符串。

C++版：

class Solution {
public:
    string alienOrder(vector<string>& words) {
        if(words.size() == 0)
            return "";
        
        unordered_map<char, vector<char>> d;
        unordered_map<char, bool> used;
        
        for(auto s : words) {
            for(int i = 0; i < s.length(); i++) {
                if(used.find(s[i]) == used.end())
                    used.insert(pair<char, bool>(s[i], false));
            }
        }
        
        for(int i = 1; i < words.size(); i++) {