leetcode228. Summary Ranges

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

解法

public class Solution {    public List<String> summaryRanges(int[] nums) {        List<String> ret = new ArrayList<>();        if (nums == null || nums.length == 0) {            return ret;        }        if (nums.length == 1) {            ret.add(nums[0] + "");            return ret;        }        for (int i = 0; i < nums.length; i++) {            int a = nums[i];            while (i + 1 < nums.length && (nums[i + 1] - nums[i] == 1)) {                i++;            }            if (a != nums[i]) {                ret.add(a + "->" + nums[i]);            } else {                ret.add(a + "");            }        }        return ret;    }}