Leetcode 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"].

Difficulty: Medium

public class Solution {    public List<String> summaryRanges(int[] nums) {        List<String> list = new ArrayList<String>();        int i = 0, len = nums.length;        while(i < len){            int start = nums[i], end = nums[i];            i++;            while(i < len && nums[i] == nums[i - 1] + 1){                end = nums[i];                i++;            }            if(start == end){                list.add(String.valueOf(start));            }            else{                list.add(String.valueOf(start) + '-' + '>' + String.valueOf(end));            }                    }        return list;    }}