Leetcode Summary Ranges

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"].

从第一个元素开始，找到连续的子序列，保存在string类型的变量里。

class Solution {
public:
vector<string> summaryRanges(vector<int>& nums) {
vector<string> result;
string temp = "";
char number[10];
bool flag = false;
for(int i=0,j=0; i<nums.size(); i++)
{
sprintf(number,"%d",nums[i]);
temp = temp + number;
while((nums[i+1]-nums[i] == 1)&&(i+1<nums.size()))
{
flag = true;
i++;
}
if(flag)
{
sprintf(number,"%d",nums[i]);
temp = temp + "->" + number;
}
flag = false;
result.push_back(temp);
temp = "";
}
return result;
}
};