-
Notifications
You must be signed in to change notification settings - Fork 0
/
228_summary_ranges.py
43 lines (39 loc) · 1.63 KB
/
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
class Solution:
def summaryRanges(self, nums: List[int]) -> List[str]:
if len(nums) == 0:
return []
elif len(nums) == 1:
return [str(nums[0])]
else:
ans = []
start = pre = nums[0]
for i in range(1, len(nums)):
curr = nums[i]
if curr == pre + 1:
pre = curr
else:
if start == pre:
ans.append(str(start))
else:
ans.append(str(start)+'->'+str(pre))
start = pre = curr
if start == pre:
ans.append(str(start))
else:
ans.append(str(start)+'->'+str(pre))
return ans
'''
This is my personal record of solving Leetcode Problems.
If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
Copyright (C) 2020-2022 mengxinayan
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
'''