Given a sorted integer array without duplicates, return the summary of its ranges.
Example 1:
Input: [0,1,2,4,5,7]
Output: ["0->2","4->5","7"]
Explanation: 0,1,2 form a continuous range; 4,5 form a continuous range.
Example 2:
Input: [0,2,3,4,6,8,9]
Output: ["0","2->4","6","8->9"]
Explanation: 2,3,4 form a continuous range; 8,9 form a continuous range.
Thoughts
双指针指向当前范围,相连就让右边的指针一直往前直到i == len(nums) - 1 or num != nums[i + 1] - 1。
Code
classSolution:defsummaryRanges(self,nums: List[int]) -> List[str]: res, beg = [],Nonefor i, num inenumerate(nums):if beg isNone: beg = numif i ==len(nums)-1or num != nums[i +1]-1:if num == beg: res.append(str(num))else: res.append(str(beg) +'->'+str(num)) beg =Nonereturn res