---
title: " Summary Ranges"
author: "KickCode"
date: "2016-02-22T04:10:08Z"
tags: []
categories: ["编程语言"]
slug: "summary-ranges"
draft: false
lastmod: "2016-02-22T04:10:08Z"
id: 2277929
url: "https://kickcode.iteye.com/blog/2277929"
---

Given a sorted integer array without duplicates, return the summary of its ranges.

For example, given , return .

从第一个元素开始，每次保留开始的元素的值，依次扫描后面的元素，如果有连续的就一直往后查找，直到遇到不连续的，然后记录这段范围。直到遍历完所有的元素。代码如下：

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

```