【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;    }