LeetCode -- Summary Ranges

标签：

public class Solution {
    public IList<string> SummaryRanges(int[] nums) {
        if(nums.Length == 0){
	    	return new List<string>();
    	}
    	
    	if(nums.Length == 1){
    		return new List<string>(){nums[0].ToString()};
    	}
    	
    	var from = nums[0];
    	var to = nums[0];
    	var ret = new List<string>();
    	for(var i = 1 ;i < nums.Length; i++){
    		if(nums[i] - nums[i-1] == 1){
    			to = nums[i];
    			if(i == nums.Length - 1){
    				ret.Add(string.Format("{0}->{1}", from , to));	
    			}
    		}
    		else{
    			if(from != to){
    				ret.Add(string.Format("{0}->{1}", from , to));	
    				if(i == nums.Length - 1 && to != nums[nums.Length - 1]){
    					ret.Add(nums[i].ToString());
    				}
    			}
    			else{
    				ret.Add(from.ToString());
    				if(i == nums.Length - 1){
    					ret.Add(nums[i].ToString());
    				}
    			}
    			from = nums[i];
    			to = nums[i];
    		}
    	}
    	
    	return ret;
    }
}

LeetCode -- Summary Ranges

标签：

原文地址：http://blog.csdn.net/lan_liang/article/details/48897071