163.py

'''
Given a sorted integer array where the range of elements are in the inclusive range [lower, upper], return its missing ranges.

For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99, return ["2", "4->49", "51->74", "76->99"].
'''

classSolution(object):
defmissingRange(self, A, lower, upper):
ifnotA:
return []

result= []
ifA[0] !=lower:
end=A[0] -1
ifend==lower:
m_r=str(lower)
else:
m_r=str(lower) +"->"+str(end)
result.append(m_r)

forindexinrange(1, len(A)):
ifA[index] !=A[index-1] +1:
start=A[index-1] +1
end=A[index] -1
ifstart==end:
m_r=str(start)
else:
m_r=str(start) +"->"+str(end)
result.append(m_r)

ifA[len(A) -1] !=upper:
start=A[len(A)-1] +1
ifstart==upper:
m_r=str(start)
else:
m_r=str(start) +"->"+str(upper)
result.append(m_r)
returnresult

solution=Solution()
printsolution.missingRange([0, 1, 3, 50, 75], 0, 99)
printsolution.missingRange([4, 10, 50, 98], 0, 99)
printsolution.missingRange([0], 0, 1)