leetcode (228) Summary Ranges js代码实现

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

给出一个数组，找出其中连续的区间，比如例子中的，0到2为一个区间，4到5为一个区间

var summaryRanges = function(nums){
	var start = 0;
	var end = 0;
	var i = 0;
	var final = new Array();
	while(end != nums.length){
		while((nums[end] + 1) == nums[end + 1]){
			end++;
		}
		if(nums[end] == nums[start]){
			final[i] = String(nums[start]);
		}else{
			final[i] = nums[start] + "->" + nums[end];	
		}
		i++;
		start = end + 1;
		end++;
	}
	return final;
};