Skip to content

Latest commit

 

History

History
 
 

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 

README.md

Check Out My YouTube Channel

Algorithm Challenge Available At CodeFights

Given a sorted integer array that does not contain any duplicates, return a summary of the number ranges it contains.

Example

  • For nums = [-1, 0, 1, 2, 6, 7, 9], the output should be composeRanges(nums) = ["-1->2", "6->7", "9"].

Hints

  • push()

Input/Output

  • [execution time limit] 5 seconds (ts)

  • [input] array.integer nums A sorted array of unique integers.

    Guaranteed constraints:

    0 ≤ nums.length ≤ 15, (231 - 1) ≤ nums[i] ≤ 231 - 1.

  • [output] array.string