题目:
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"].
思路:
思路简单:看看当前数字是否和前一个数字相差1,如果是,则更新当前区间;否则就开始一个新区间。
代码:
class Solution {
public:
vector<string> summaryRanges(vector<int>& nums) {
vector<string> ret;
if (nums.size() == 0) {
return ret;
}
int start = nums[0], end = nums[0];
for (int i = 1; i < nums.size(); ++i) {
if (nums[i] == end + 1) {
end = nums[i];
}
else {
if (start == end) {
ret.push_back(to_string(start));
}
else {
ret.push_back(to_string(start) + "->" + to_string(end));
}
start = end = nums[i];
}
}
if (start == end) {
ret.push_back(to_string(start));
}
else {
ret.push_back(to_string(start) + "->" + to_string(end));
}
return ret;
}
};