【问题描述】
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"].
【思路】
维护两个指针,start与end,如果nums[end+1] == nums[end],移动end,否则记录start到end的路径到list里。
【code】
public class Solution {
public List<String> summaryRanges(int[] nums) {
List<String> result = new ArrayList<String>();
if (nums == null || nums.length <= 0) {
return result;
}
int start = 0, end = 0;
while (end < nums.length) {
if (end + 1 < nums.length && nums[end + 1] == nums[end] + 1) {
end++;
} else {
if (start == end) {
result.add(Integer.toString(nums[end]));
} else {
String str = nums[start] + "->" + nums[end];
result.add(str);
}
end++;
start = end;
}
}
return result;
}
}