Given a sorted integer array where the range of elements are [0, 99] inclusive, return its missing ranges.
For example, given [0, 1, 3, 50, 75], return [“2”, “4->49”, “51->74”, “76->99”]
这也是Google Interview的电面题目。
[分析]
一遍线性扫描即可。
[注意事项]
1)针对一些特殊情况,询问面试官,比如说如果array是个空的,或者array包含区间内的所有元素,相应的返回值是什么
2)可以给出一些有意思的test case,另外就是不需要限制给出的范围是[0, 99],用start和end表示就行。在面试的时候可以先提一下,写出[0, 99]的代码,然后在稍作修改,变成start和end的版本。
public List<String> findMissingRanges(int[] vals, int start, int end) {
List<String> ranges = new ArrayList<String>();
int prev = start - 1;
for (int i=0; i<=vals.length; ++i) {
int curr = (i==vals.length) ? end + 1 : vals[i];
if ( cur-prev>=2 ) {
ranges.add(getRange(prev+1, curr-1));
}
rev = curr;
}
return ranges;
}
private String getRange(int from, int to) {
return (from==to) ? String.valueOf(from) : from + "->" to;
}
另外一种写法:
public String missingRanges(int[] A) {
int prev = -1, n = A.length;
StringBuilder sb = new StringBuilder();
for(int i=0; i<=n; i++) {
int val = (i==n) ? 100 : A[i];
if(val != prev+1) {
int low = prev+1;
int high = val-1;
if(sb.length() != 0) sb.append(",");
if(low == high) sb.append(low);
else sb.append(low + "-" + high);
}
prev = val;
}
return sb.toString();
}