LeetCode Q228: 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"].

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

	class Solution {
	public:
	vector<string> summaryRanges(vector<int>& nums) {
	vector<string> res;
	int p0=0, p1=1;
	for(p1=1; p1<=nums.size(); p1++){
	if(p1<nums.size()&&nums[p1]-nums[p1-1]==1)
	continue;
	else{
	string r;
	if(nums[p1-1]!=nums[p0])
	r=to_string(nums[p0])+string("->")+to_string(nums[p1-1]);
	else
	r=to_string(nums[p0]);
	p0=p1;
	res.push_back(r);
	}
	}
	return res;
	}
	};

view raw Q228SummaryRanges.cpp hosted with ❤ by GitHub