Leetcode之Summary Ranges

题目：

Given a sorted integer array without duplicates, return the summary of its ranges.

Example 1:

Input:  [0,1,2,4,5,7]
Output: ["0->2","4->5","7"]
Explanation: 0,1,2 form a continuous range; 4,5 form a continuous range.

Example 2:

Input:  [0,2,3,4,6,8,9]
Output: ["0","2->4","6","8->9"]
Explanation: 2,3,4 form a continuous range; 8,9 form a continuous range.

代码：

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        int len = nums.size();
	if (len == 0)return {  };
	if (len == 1)return { to_string(nums[0]) };
	long left = nums[0], right = nums[0];
	nums.push_back(INT_MAX);
	vector<string> res;
	for (int i = 0; i < len; i++) {
		if (nums[i+1]>nums[i]&&nums[i + 1] == nums[i]+1)right++;
		else {
			string s;
			if (left == right) {
				s = to_string(left);
			}
			else {
				s = to_string(left) + "->" + to_string(right);
			}
			res.push_back(s);
			left = nums[i+1]; right = nums[i+1];
		}
	}
	return res;
    }
};