文件: root - text - article - 2020 - 02 - sort-a-partially-sorted-list.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 498 次阅读, 25021 次搜索 | 93 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 498 次阅读, 25021 次搜索 | 93 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Uber:
You are given a list of n numbers, where every number is at most k indexes away from its properly sorted index. Write a sorting algorithm (that will be given the number k) for this list that can solve this in O(n log k)
Example:
Input: [3, 2, 6, 5, 4], k=2
Output: [2, 3, 4, 5, 6]
As seen above, every number is at most 2 indexes away from its proper sorted index.
Here's a starting point:
def sort_partially_sorted(nums, k):
# Fill this in.
print sort_partially_sorted([3, 2, 6, 5, 4], 2)
# [2, 3, 4, 5, 6]
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 498 次阅读, 25021 次搜索 | 93 个单词 You are given a list of n numbers, where every number is at most k indexes away from its properly sorted index. Write a sorting algorithm (that will be given the number k) for this list that can solve this in O(n log k)
Example:
Input: [3, 2, 6, 5, 4], k=2
Output: [2, 3, 4, 5, 6]
As seen above, every number is at most 2 indexes away from its proper sorted index.
Here's a starting point:
def sort_partially_sorted(nums, k):
# Fill this in.
print sort_partially_sorted([3, 2, 6, 5, 4], 2)
# [2, 3, 4, 5, 6]
猜您喜欢...
- [Daily Problem] Course Prerequisites
- Generate All IP Addresses
- Absolute Path
- Daily Interview Problem: Tree Serialization
- Algorithm Interview Question: Find the Single Element in an Array of Duplicates
- Daily Interview Problem: Circle of Chained Words
- Daily Interview Problem: Group Words that are Anagrams
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Number of Ways to Climb Stairs
- Daily Interview Puzzle: Falling Dominoes
©2006~2024 牛排过熟 - 0.00826 秒 - 6709.151 KB/s - 13 在线 内存: 517.02 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。