文件: root - text - article - 2019 - 12 - word-ordering-in-a-different-alphabetical-order.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 247 次阅读, 20466 次搜索 | 107 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 247 次阅读, 20466 次搜索 | 107 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Apple:
Given a list of words, and an arbitrary alphabetical order, verify that the words are in order of the alphabetical order.
Example:
Input:
Output: False
Explanation: 'e' comes before 'a' so 'efgh' should come before 'abcd'
Example 2:
Input:
Output: True
Explanation: The words are in increasing alphabetical order
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 247 次阅读, 20466 次搜索 | 107 个单词 Given a list of words, and an arbitrary alphabetical order, verify that the words are in order of the alphabetical order.
Example:
Input:
words = ["abcd", "efgh"], order="zyxwvutsrqponmlkjihgfedcba"
Output: False
Explanation: 'e' comes before 'a' so 'efgh' should come before 'abcd'
Example 2:
Input:
words = ["zyx", "zyxw", "zyxwy"],
order="zyxwvutsrqponmlkjihgfedcba"
Output: True
Explanation: The words are in increasing alphabetical order
Here's a starting point:
def isSorted(words, order):
# Fill this in.
print isSorted(["abcd", "efgh"], "zyxwvutsrqponmlkjihgfedcba")
# False
print isSorted(["zyx", "zyxw", "zyxwy"],
"zyxwvutsrqponmlkjihgfedcba")
# True
猜您喜欢...
- Daily Interview Problem: Minimum Removals for Valid Parenthesis
- Daily Interview Problem: Spiral Traversal of Grid
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- YES!!
- Daily Interview Puzzle: Minimum Size Subarray Sum
- Batch Programming in XP
- Plus One
- Number of Ways to Climb Stairs
- Daily Interview Problem: Circle of Chained Words
- Algorithm Interview: Maximum Path Sum in Binary Tree
©2006~2024 牛排过熟 - 0.01115 秒 - 4993.742 KB/s - 35 在线 内存: 518.98 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。