class Solution {
public List<String> summaryRanges(int[] nums) {
List<String> list = new ArrayList<>();
int i = 0;
int n = nums.length;
while(i<n){
int low = i;
i++;
//while当不连续时,退出循环.
while(i<n&&nums[i]==nums[i-1]+1){
i++;
}
//此时high需要--
int high = i-1;
//先把low放进去,再根据情况判断连不连high部分
StringBuilder sb = new StringBuilder(Integer.toString(nums[low]));
if(low<high){
sb.append("->");
sb.append(Integer.toString(nums[high]));
}
list.add(sb.toString());
}
return list;
}
}