class Solution {
public:
vector<string> summaryRanges(vector<int>& nums)
{
vector<string>res;
for(int i=0;i<nums.size();i++)
{
string ans;
ans+=to_string(nums[i]);
int index=i;
while(i<nums.size()-1&&nums[i+1] -1==nums[i])//不要写成nums[i+1]-nums[i]==1因为[-2147483648,-2147483647,2147483647]测试用例上会超出范围
{
i++;
}
if(index!=i)
{
ans+="->"+to_string(nums[i]);
}
res.push_back(ans);
}
return res;
}
};
leetcode 228. 汇总区间
最新推荐文章于 2024-07-25 19:34:38 发布