文件: root - text - article - 2019 - 12 - merge-list-of-number-into-ranges.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 429 次阅读, 25047 次搜索 | 98 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 429 次阅读, 25047 次搜索 | 98 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Facebook:
Given a sorted list of numbers, return a list of strings that represent all of the consecutive numbers.
Example:
Input: [0, 1, 2, 5, 7, 8, 9, 9, 10, 11, 15]
Output: ['0->2', '5->5', '7->11', '15->15']
Assume that all numbers will be greater than or equal to 0, and each element can repeat.
Here is a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 429 次阅读, 25047 次搜索 | 98 个单词 Given a sorted list of numbers, return a list of strings that represent all of the consecutive numbers.
Example:
Input: [0, 1, 2, 5, 7, 8, 9, 9, 10, 11, 15]
Output: ['0->2', '5->5', '7->11', '15->15']
Assume that all numbers will be greater than or equal to 0, and each element can repeat.
Here is a starting point:
def findRanges(nums):
# Fill this in.
print findRanges([0, 1, 2, 5, 7, 8, 9, 9, 10, 11, 15])
# ['0->2', '5->5', '7->11', '15->15']
猜您喜欢...
- Find Missing Numbers in an Array
- Daily Interview Problem: Tree Serialization
- Progess made
- [Daily Problem] Longest Increasing Subsequence
- Daily Interview Problem: Longest Substring With K Distinct Characters
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
- Daily Interview Problem: Min Range Needed to Sort
- Daily Interview Problem: Trapping Rainwater
- Windows Scripting
- Daily Interview Problem: Maximum Profit From Stocks
©2006~2024 牛排过熟 - 0.00944 秒 - 2085.071 KB/s - 38 在线 内存: 493.39 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。