class Solution {
public:
vector<string> summaryRanges(vector<int>& nums)
{
vector<string> ret;
int size = nums.size();
for (int i, j = 0; j < size; j++)
{
i = j;
while (j + 1 < size && nums[j + 1] == nums[j] + 1)
j++;
if (i == j)
ret.emplace_back(to_string(nums[i]));
else
ret.emplace_back(to_string(nums[i]) + "->" + to_string(nums[j]));
}
return ret;
}
};
Leetcode 228. 汇总区间
最新推荐文章于 2024-10-08 10:36:00 发布