【leetcode】【228】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"].

二、問題分析

涉及數組的遍歷和字符串的拼裝。問題不大。

三、Java AC代碼

public List<String> summaryRanges(int[] nums) {
        List<String> list = new ArrayList<String>();
		int len = nums.length;
		if (nums==null || len==0) {
			return list;
		}
		StringBuilder sb = null;
		for (int i = 0; i < len; i++) {
			int tmp = nums[i];
			sb = new StringBuilder();
			sb.append(tmp);
			while(i+1<len && nums[i]+1==nums[i+1]){
				i++;
			}
			if (nums[i]!=tmp) {
				sb.append("->").append(nums[i]);
			}
			list.add(sb.toString());
		}
		return list;
    }