leetcode每周5题系列,一年250道题目,坚持更新。
cpp
class Solution {
public:
vector<string> summaryRanges(vector<int>& nums) {
vector<string> ret;
int i = 0;
int n = nums.size();
while (i < n) {
int low = i;
i++;
while (i < n && nums[i] == nums[i - 1] + 1) {
i++;
}
int high = i - 1;
string tmp = to_string(nums[low]);
if (low < high) {
tmp.append("->");
tmp.append(to_string(nums[high]));
}
ret.push_back(move(tmp)); // move(tmp) 避免不必要的拷贝操作
}
return ret;
}
};