-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path0164-maximum-gap.js
More file actions
58 lines (44 loc) · 2.3 KB
/
0164-maximum-gap.js
File metadata and controls
58 lines (44 loc) · 2.3 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
47
48
49
50
51
52
53
54
55
56
57
58
/**
* Maximum Gap
* Time Complexity: O(N)
* Space Complexity: O(N)
*/
var maximumGap = function(nums) {
const totalElements = nums.length;
if (totalElements < 2) {
return 0;
}
let overallMinimumValue = Infinity;
let overallMaximumValue = -Infinity;
for (let elementScanIndex = 0; elementScanIndex < totalElements; elementScanIndex++) {
const currentNumericalValue = nums[elementScanIndex];
overallMinimumValue = Math.min(overallMinimumValue, currentNumericalValue);
overallMaximumValue = Math.max(overallMaximumValue, currentNumericalValue);
}
if (overallMinimumValue === overallMaximumValue) {
return 0;
}
const calculatedBucketSize = Math.max(1, Math.floor((overallMaximumValue - overallMinimumValue) / (totalElements - 1)));
const numberOfBuckets = Math.floor((overallMaximumValue - overallMinimumValue) / calculatedBucketSize) + 1;
const bucketMinValueStorage = new Array(numberOfBuckets).fill(Infinity);
const bucketMaxValueStorage = new Array(numberOfBuckets).fill(-Infinity);
const bucketContentStatus = new Array(numberOfBuckets).fill(false);
for (let valuePlacementIndex = 0; valuePlacementIndex < totalElements; valuePlacementIndex++) {
const valueToDistribute = nums[valuePlacementIndex];
const bucketDesignation = Math.floor((valueToDistribute - overallMinimumValue) / calculatedBucketSize);
bucketMinValueStorage[bucketDesignation] = Math.min(bucketMinValueStorage[bucketDesignation], valueToDistribute);
bucketMaxValueStorage[bucketDesignation] = Math.max(bucketMaxValueStorage[bucketDesignation], valueToDistribute);
bucketContentStatus[bucketDesignation] = true;
}
let maximumGapFound = 0;
let previousBucketHigh = overallMinimumValue;
for (let bucketIterationIndex = 0; bucketIterationIndex < numberOfBuckets; bucketIterationIndex++) {
if (!bucketContentStatus[bucketIterationIndex]) {
continue;
}
maximumGapFound = Math.max(maximumGapFound, bucketMinValueStorage[bucketIterationIndex] - previousBucketHigh);
previousBucketHigh = bucketMaxValueStorage[bucketIterationIndex];
}
maximumGapFound = Math.max(maximumGapFound, overallMaximumValue - previousBucketHigh);
return maximumGapFound;
};