algorithms-python/array/missing_ranges.py at master · izanbf1803/algorithms-python · GitHub

27 lines (24 loc) · 684 Bytes

## find missing ranges between low and high in the given array.

# ex) [3, 5] lo=1 hi=10 => answer: [1->2, 4, 6->10]

def missing_ranges(nums, lo, hi):

res = []

start = lo

for num in nums:

if num < start:

continue

if num == start:

start += 1

continue

res.append(get_range(start, num-1))

start = num + 1

if start <= hi:

res.append(get_range(start, hi))

return res

def get_range(n1, n2):

if n1 == n2:

return str(n1)

else:

return str(n1) + "->" + str(n2)

nums = [3, 5, 10, 11, 12, 15, 19]

print("original:", nums)

print("missing range: ", missing_ranges(nums,0,20))

Expand file tree