Problem:
Given a sorted integer array without duplicates, return the summary of its ranges.
For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].
Answer:
class Solution(object):
def summaryRanges(self, nums):
"""
:type nums: List[int]
:rtype: List[str]
"""
result = []
if len(nums) == 0:
return result
for index in range(len(nums)):
if index == 0:
start = nums[index]
continue
if nums[index]!=nums[index-1]+1:
if nums[index-1]==start:
result.append(str(start))
else:
result.append(str(start)+'->'+str(nums[index-1]))
start = nums[index]
if nums[-1] == start:
result.append(str(start))
else:
result.append(str(start)+'->'+str(nums[-1]))
return result

本文介绍了一种算法,用于处理已排序且不包含重复元素的整数数组,并返回该数组中连续区间的汇总。例如,对于输入数组 [0,1,2,4,5,7],算法将返回 ['0->2', '4->5', '7']。

被折叠的 条评论
为什么被折叠?



