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

class Solution:
# @param {integer[]} nums
# @return {string[]}
def summaryRanges(self, nums):
if not nums:
return []
i = 0
j = 0
b = []
while(i < len(nums)):
start = nums[j]
end = start
if(i + 1 == len(nums)):
end = nums[i]
b.append(str(end))
break
if(nums[i + 1] - nums[i] != 1):
end = nums[i]
j = i + 1
tmp = str(start) + "->" + str(end)
b.append(tmp)
i += 1
return b