-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path228 Summary Ranges.py
44 lines (33 loc) · 967 Bytes
/
228 Summary Ranges.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
"""
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"].
Author: Rajeev Ranjan
"""
class Solution:
def summaryRanges(self, nums):
"""
:type nums: list[int]
:rtype: list[str]
"""
ret = []
n = len(nums)
if n < 1:
return ret
bgn = nums[0]
pre = nums[0]
for i in xrange(1, n):
if nums[i] != pre+1:
if pre != bgn:
ret.append("%d->%d"%(bgn, pre))
else:
ret.append("%d"%bgn)
bgn = nums[i]
pre = nums[i]
# clean up
if pre != bgn:
ret.append("%d->%d"%(bgn, pre))
else:
ret.append("%d"%bgn)
return ret
if __name__ == "__main__":
assert Solution().summaryRanges([0, 1, 2, 4, 5, 7]) == ['0->2', '4->5', '7']