Leetcode 228. Summary Ranges (Medium) (cpp)
Tag: Array
Difficulty: Medium
/*
228. Summary Ranges (Medium)
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 {
public:
vector<string> summaryRanges(vector<int>& nums) {
vector<string> res;
int lower = 0;
nums.push_back(INT_MAX);
for (int i = 1; i < nums.size(); i++) {
if (nums[i] > nums[i - 1] + 1) {
res.push_back(subrange(nums[lower], nums[i - 1]));
lower = i;
}
}
return res;
}
string subrange(int lower, int higher) {
return lower == higher ? to_string(lower) : to_string(lower) + "->" + to_string(higher);
}
};