Day047 - 228. Summary Ranges
업데이트:
228. Summary RangesPermalink
You are given a sorted unique integer array nums.
A range [a,b] is the set of all integers from a to b (inclusive).
Return the smallest sorted list of ranges that cover all the numbers in the array exactly. That is, each element of nums is covered by exactly one of the ranges, and there is no integer x such that x is in one of the ranges but not in nums.
Each range [a,b] in the list should be output as:
"a->b"ifa != b"a"ifa == b
Example 1:
Input: nums = [0,1,2,4,5,7]
Output: ["0->2","4->5","7"]
Explanation: The ranges are:
[0,2] --> "0->2"
[4,5] --> "4->5"
[7,7] --> "7"
Example 2:
Input: nums = [0,2,3,4,6,8,9]
Output: ["0","2->4","6","8->9"]
Explanation: The ranges are:
[0,0] --> "0"
[2,4] --> "2->4"
[6,6] --> "6"
[8,9] --> "8->9"
Constraints:
0 <= nums.length <= 20-231 <= nums[i] <= 231 - 1- All the values of
numsare unique. numsis sorted in ascending order.
내 풀이Permalink
from collections import deque
class Solution:
def summaryRanges(self, nums: List[int]) -> List[str]:
if len(nums) == 0: return []
nums = deque(nums)
answer = []
temp_answer = [nums.popleft()]
while nums:
check_num = nums.popleft()
if check_num == temp_answer[-1]+1:
temp_answer.append(check_num)
else:
answer.append(temp_answer)
temp_answer = [check_num]
answer.append(temp_answer)
answer = [str(i[0]) if len(i)==1 else f"{i[0]}->{i[-1]}" for i in answer]
return answer
# Time Complexity :
댓글남기기