页面顶部 Top
文件:  root - text - article - 2019 - 12 - word-ordering-in-a-different-alphabetical-order.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 189 次阅读, 16956 次搜索 | 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:

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, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 189 次阅读, 16956 次搜索 | 107 个单词 定阅此目录的博客

猜您喜欢...

  1. Floor and Ceiling of a Binary Search Tree
  2. Daily Interview Question: Longest Sequence with Two Unique Numbers
  3. Daily Interview Problem: Largest BST in a Binary Tree
  4. Daily Interview Problem: Tree Serialization
  5. Delphi Dynamic Array
  6. CPU Utilization
  7. Invert a Binary Tree
  8. Daily Interview Problem: 3 Sum
  9. Binary Tree Level with Minimum Sum
  10. Progess made

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">