We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent d2dd3ab commit ff5c660Copy full SHA for ff5c660
solution/0700-0799/0719.Find K-th Smallest Pair Distance/Solution.js
@@ -4,14 +4,15 @@
4
* @return {number}
5
*/
6
function smallestDistancePair(nums, k) {
7
- nums.sort((a, b) => a - b);
+ nums.sort((a, b) => a - b);
8
const n = nums.length;
9
let left = 0,
10
- right = nums[n - 1] - nums[0];
+ right = nums[n - 1] - nums[0];
11
12
while (left < right) {
13
let mid = Math.floor((left + right) / 2);
14
- let count = 0, i = 0;
+ let count = 0,
15
+ i = 0;
16
17
for (let j = 0; j < n; j++) {
18
while (nums[j] - nums[i] > mid) {
0 commit comments