leetcode 228 Summary Ranges

Summary Ranges https://leetcode.com/problems/summary-ranges/

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"].

 1 class Solution:
 2     # @param {integer[]} nums
 3     # @return {string[]}
 4     def summaryRanges(self, nums):
 5         if not nums:
 6             return []
 7         i = 0
 8         j = 0
 9         b = []
10         while(i < len(nums)):
11             start = nums[j]
12             end = start
13             if(i + 1 == len(nums)):
14                 end = nums[i]
15                 b.append(str(end))
16                 break
17             if(nums[i + 1] - nums[i] != 1):
18                 end = nums[i]
19                 j = i + 1
20                 tmp = str(start) + "->" + str(end)
21                 b.append(tmp)
22             i += 1
23         return b

 

转载于:https://www.cnblogs.com/wnan42/p/4675330.html