LeetCode --- 953. Verifying an Alien Dictionary 解题报告

杨鑫newlfe

于 2021-06-20 12:52:12 发布

阅读量268

点赞数

CC 4.0 BY-SA版权

分类专栏： Python 算法 LeetCode 文章标签： LeetCode Python 算法面试

本文链接：https://blog.csdn.net/u012965373/article/details/118068552

算法同时被 3 个专栏收录

850 篇文章 ¥9.90 ¥99.00

订阅专栏

Python

714 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

438 篇文章

订阅专栏

这篇博客详细介绍了如何解决LeetCode中的953题——验证外星字典。题目涉及使用一种字母顺序可能与英语不同的外星语言，要求判断给定的单词序列是否按此外星语言的字典顺序排列。博客中提供了示例和约束条件，并提及所有代码可在GitHub上获取。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

In an alien language, surprisingly they also use english lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.

Given a sequence of words written in the alien language, and the order of the alphabet, return true if and only if the given words are sorted lexicographicaly in this alien language.

Example 1:

Input: words = ["hello","leetcode"], order = "hlabcdefgijkmnopqrstuvwxyz"
Output: true
Explanation: As 'h' comes before 'l' in this language, then the sequence is sorted.

了解本专栏