页面顶部 Top
文件:  root - text - article - 2019 - 12 - merge-list-of-number-into-ranges.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 244 次阅读, 23242 次搜索 | 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:


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']
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 244 次阅读, 23242 次搜索 | 98 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  2. Patterns for breaking down questions you haven
  3. [Daily Problem] Longest Increasing Subsequence
  4. Kaprekar
  5. Algorithm Interview: Determine If Linked List is Palindrome
  6. Binary Tree Level with Minimum Sum
  7. Fix Brackets
  8. Consecutive Ones
  9. Number of Ways to Climb Stairs
  10. Plus One

评论 (0)

    当前页暂时没有评论。


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