forked from kdn251/interviews
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsummaryRanges.java
More file actions
46 lines (24 loc) · 1.01 KB
/
summaryRanges.java
File metadata and controls
46 lines (24 loc) · 1.01 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
// 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> result = new ArrayList();
if(nums.length == 1) {
result.add(nums[0] + "");
return result;
}
for(int i = 0; i < nums.length; i++) {
int current = nums[i];
while(i + 1 < nums.length && (nums[i + 1] - nums[i] == 1)) {
i++;
}
if(current != nums[i]) {
result.add(current + "->" + nums[i]);
}
else {
result.add(current + "");
}
}
return result;
}
}