Problem
Given a sorted integer array without duplicates, return the summary of its ranges.
Example 1:
Input: [0,1,2,4,5,7] Output: ["0->2","4->5","7"] Explanation: 0,1,2 form a continuous range; 4,5 form a continuous range.
Example 2:
Input: [0,2,3,4,6,8,9] Output: ["0","2->4","6","8->9"] Explanation: 2,3,4 form a continuous range; 8,9 form a continuous range.
Solution
Time complexity: O(n)
Space complexity: O(k)
C++
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
// Author: Huahua // Running time: 3 ms class Solution { public: vector<string> summaryRanges(vector<int>& nums) { int s = 0; vector<string> ans; for (size_t i = 1; i <= nums.size(); ++i) { if (i == nums.size() || nums[i] != nums[i - 1] + 1) { if (s == i - 1) ans.push_back(to_string(nums[s])); else ans.push_back(to_string(nums[s]) + "->" + to_string(nums[i - 1])); s = i; } } return ans; } }; |
请尊重作者的劳动成果,转载请注明出处!花花保留对文章/视频的所有权利。
如果您喜欢这篇文章/视频,欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Be First to Comment