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 | 242 Views, 21990 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 | 242 Views, 21990 Search Bots | 98 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Reverse Integer
  2. Daily Interview Problem: Merge Overlapping Intervals
  3. Daily Interview Problem: Arithmetic Binary Tree
  4. Daily Interview Problem: Jump to the End
  5. [Daily Problem] Course Prerequisites
  6. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  7. [Daily Problem] Angles of a Clock
  8. Reverse a Linked List
  9. Daily Interview Problem: Find the k-th Largest Element in a List
  10. Design Tic-Tac-Toe

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="index, follow">