文件: root - text - article - 2019 - 12 - min-range-needed-to-sort.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 592 次阅读, 18983 次搜索 | 70 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 592 次阅读, 18983 次搜索 | 70 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Twitter:
Given a list of integers, return the bounds of the minimum range that must be sorted so that the whole list would be sorted.
Example:
Input: [1, 7, 9, 5, 7, 8, 10]
Output: (1, 5)
Explanation:
The numbers between index 1 and 5 are out of order and need to be sorted.
Here's your starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 592 次阅读, 18983 次搜索 | 70 个单词 Given a list of integers, return the bounds of the minimum range that must be sorted so that the whole list would be sorted.
Example:
Input: [1, 7, 9, 5, 7, 8, 10]
Output: (1, 5)
Explanation:
The numbers between index 1 and 5 are out of order and need to be sorted.
Here's your starting point:
def findRange(nums):
# Fill this in.
print findRange([1, 7, 9, 5, 7, 8, 10])
# (1, 5)
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- [Daily Problem] Longest Palindromic Substring
- Find Pythagorean Triplets
- Daily Interview Problem: Longest Substring With K Distinct Characters
- Detect Linked List Cycle
- Sort a Partially Sorted List
- Top K Frequent words
- Multitasking
- A trick for getting good at coding interviews FASTER
- Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
©2006~2024 牛排过熟 - 0.00829 秒 - 6576.102 KB/s - 72 在线
内存: 516.69 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="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。