23 lines
615 B
Text
23 lines
615 B
Text
|
int maxBuckets(int[] sBucket, int[] eBucket, int numBuckets, int range) {
|
||
|
|
var buckets = new int[range];
|
||
|
|
for (var i=0; i<numBuckets; i=i+1;) {
|
||
|
|
buckets[sBucket[i]] = buckets[sBucket[i]] + 1;
|
||
|
|
buckets[eBucket[i]] = buckets[eBucket[i]] - 1;
|
||
|
|
}
|
||
|
|
var max = 0;
|
||
|
|
var curr = 0;
|
||
|
|
for (var i=0; i<range; i=i+1;) {
|
||
|
|
curr = curr + buckets[i];
|
||
|
|
if (curr > max) {
|
||
|
|
max = curr;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return max;
|
||
|
|
}
|
||
|
|
|
||
|
|
int program (int argc, string[] argv) {
|
||
|
|
var s1 = new int[]{0, 1, 2, 3, 4};
|
||
|
|
var e1 = new int[]{5, 6, 7, 8, 9};
|
||
|
|
return maxBuckets(s1, e1, 5, 10);
|
||
|
|
}
|