To the Top
File:  root - text - article - 2019 - 12 - merge-list-of-number-into-ranges.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 244 Views, 22213 Search Bots | 98 Words

Subscribe to Feed Burner | Browse | Archive
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']
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 244 Views, 22213 Search Bots | 98 Words Subscribe to Feed Burner

Related Articles

  1. Skip the readings, focus on problems. And use all the hints!
  2. Spectrum Master
  3. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  4. Daily Interview Problem: Look and Say Sequence
  5. Longest Substring Without Repeating Characters
  6. Daily Interview Problem: Jump to the End
  7. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  8. ImageMagick Vulnerabilities -  CVE-2016–3714
  9. Non-decreasing Array with Single Modification
  10. [Daily Problem] Remove k-th Last Element From Linked List

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />