LC 0163 [E] Missing Ranges - ALawliet/algorithms GitHub Wiki
class Solution:
def findMissingRanges(self, nums: List[int], lower: int, upper: int) -> List[str]:
nums = [lower-1] + nums + [upper+1]
print(nums)
res = []
for a, b in zip(nums, nums[1:]):
if a+2 == b:
res.append(f'{a+1}')
elif a+2 < b:
res.append(f'{a+1}->{b-1}')
return res
class Solution(object):
def findMissingRanges(self, nums, lower, upper):
nums = [lower - 1] + nums + [upper + 1]
ranges = []
for index in range(1, len(nums)):
if nums[index] - nums[index - 1] == 2:
ranges.append(str(nums[index] - 1))
elif nums[index] - nums[index - 1] > 2:
ranges.append(str(nums[index - 1] + 1) + "->" + str(nums[index] - 1))
return ranges