Commit 09bc93a

committed

feat: add typescript solution to lc problem: No.0719

No.0719.Find K-th Smallest Pair Distance

1 parent dc4dbb8 commit 09bc93aCopy full SHA for 09bc93a

File tree

+76

-0

lines changed

+76

-0

lines changed

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -53,6 +53,33 @@ k = 1`
`53`	`53`
`54`	`54`	```
`55`	`55`
	`56`	`+### TypeScript`
	`57`	`+`
	`58`	+```ts
	`59`	`+function smallestDistancePair(nums: number[], k: number): number {`
	`60`	`+ nums.sort((a, b) => a - b);`
	`61`	`+ const n = nums.length;`
	`62`	`+ let left = 0, right = nums[n - 1] - nums[0];`
	`63`	`+ while (left < right) {`
	`64`	`+ let mid = (left + right) >> 1;`
	`65`	`+ let count = 0, i = 0;`
	`66`	`+ for (let j = 0; j < n; j++) {`
	`67`	`+ // 索引[i, j]距离nums[j]的距离<=mid`
	`68`	`+ while (nums[j] - nums[i] > mid) {`
	`69`	`+ i++;`
	`70`	`+ }`
	`71`	`+ count += (j - i);`
	`72`	`+ }`
	`73`	`+ if (count >= k) {`
	`74`	`+ right = mid;`
	`75`	`+ } else {`
	`76`	`+ left = mid + 1;`
	`77`	`+ }`
	`78`	`+ }`
	`79`	`+ return left;`
	`80`	`+};`
	`81`	+```
	`82`	`+`
`56`	`83`	`### ...`
`57`	`84`
`58`	`85`	```

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -64,6 +64,33 @@ Then the 1st smallest distance pair is (1,1), and its distance is 0.`
`64`	`64`
`65`	`65`	```
`66`	`66`
	`67`	`+### TypeScript`
	`68`	`+`
	`69`	+```ts
	`70`	`+function smallestDistancePair(nums: number[], k: number): number {`
	`71`	`+ nums.sort((a, b) => a - b);`
	`72`	`+ const n = nums.length;`
	`73`	`+ let left = 0, right = nums[n - 1] - nums[0];`
	`74`	`+ while (left < right) {`
	`75`	`+ let mid = (left + right) >> 1;`
	`76`	`+ let count = 0, i = 0;`
	`77`	`+ for (let j = 0; j < n; j++) {`
	`78`	`+ // 索引[i, j]距离nums[j]的距离<=mid`
	`79`	`+ while (nums[j] - nums[i] > mid) {`
	`80`	`+ i++;`
	`81`	`+ }`
	`82`	`+ count += (j - i);`
	`83`	`+ }`
	`84`	`+ if (count >= k) {`
	`85`	`+ right = mid;`
	`86`	`+ } else {`
	`87`	`+ left = mid + 1;`
	`88`	`+ }`
	`89`	`+ }`
	`90`	`+ return left;`
	`91`	`+};`
	`92`	+```
	`93`	`+`
`67`	`94`	`### ...`
`68`	`95`
`69`	`96`	```

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,22 @@`
	`1`	`+function smallestDistancePair(nums: number[], k: number): number {`
	`2`	`+ nums.sort((a, b) => a - b);`
	`3`	`+ const n = nums.length;`
	`4`	`+ let left = 0, right = nums[n - 1] - nums[0];`
	`5`	`+ while (left < right) {`
	`6`	`+ let mid = (left + right) >> 1;`
	`7`	`+ let count = 0, i = 0;`
	`8`	`+ for (let j = 0; j < n; j++) {`
	`9`	`+ // 索引[i, j]距离nums[j]的距离<=mid`
	`10`	`+ while (nums[j] - nums[i] > mid) {`
	`11`	`+ i++;`
	`12`	`+ }`
	`13`	`+ count += (j - i);`
	`14`	`+ }`
	`15`	`+ if (count >= k) {`
	`16`	`+ right = mid;`
	`17`	`+ } else {`
	`18`	`+ left = mid + 1;`
	`19`	`+ }`
	`20`	`+ }`
	`21`	`+ return left;`
	`22`	`+};`

Comments

(0)