Commit bcc6037

authored

feat: add solutions to lc problem: No.1539 (doocs#601)

No.1539.Kth Missing Positive Number

1 parent 497b160 commit bcc6037Copy full SHA for bcc6037

File tree

+90

-4

lines changed

+90

-4

lines changed

Lines changed: 30 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -49,15 +49,43 @@`
`49`	`49`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`50`	`50`
`51`	`51`	```python
`52`		`-`
	`52`	`+class Solution:`
	`53`	`+ def findKthPositive(self, arr: List[int], k: int) -> int:`
	`54`	`+ if arr[0] > k:`
	`55`	`+ return k`
	`56`	`+ left, right = 0, len(arr)`
	`57`	`+ while left < right:`
	`58`	`+ mid = (left + right) // 2`
	`59`	`+ if arr[mid] - mid - 1 < k:`
	`60`	`+ left = mid + 1`
	`61`	`+ else:`
	`62`	`+ right = mid`
	`63`	`+ return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1]`
`53`	`64`	```
`54`	`65`
`55`	`66`	`### Java`
`56`	`67`
`57`	`68`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`58`	`69`
`59`	`70`	```java
`60`		`-`
	`71`	`+class Solution {`
	`72`	`+ public int findKthPositive(int[] arr, int k) {`
	`73`	`+ if (arr[0] > k) {`
	`74`	`+ return k;`
	`75`	`+ }`
	`76`	`+ int left = 0, right = arr.length;`
	`77`	`+ while (left < right) {`
	`78`	`+ int mid = (left + right) >> 1;`
	`79`	`+ int cur = mid == arr.length ? Integer.MAX_VALUE : arr[mid];`
	`80`	`+ if (cur - mid - 1 < k) {`
	`81`	`+ left = mid + 1;`
	`82`	`+ } else {`
	`83`	`+ right = mid;`
	`84`	`+ }`
	`85`	`+ }`
	`86`	`+ return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1];`
	`87`	`+ }`
	`88`	`+}`
`61`	`89`	```
`62`	`90`
`63`	`91`	`### ...`

Lines changed: 30 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -43,13 +43,41 @@`
`43`	`43`	`### Python3`
`44`	`44`
`45`	`45`	```python
`46`		`-`
	`46`	`+class Solution:`
	`47`	`+ def findKthPositive(self, arr: List[int], k: int) -> int:`
	`48`	`+ if arr[0] > k:`
	`49`	`+ return k`
	`50`	`+ left, right = 0, len(arr)`
	`51`	`+ while left < right:`
	`52`	`+ mid = (left + right) // 2`
	`53`	`+ if arr[mid] - mid - 1 < k:`
	`54`	`+ left = mid + 1`
	`55`	`+ else:`
	`56`	`+ right = mid`
	`57`	`+ return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1]`
`47`	`58`	```
`48`	`59`
`49`	`60`	`### Java`
`50`	`61`
`51`	`62`	```java
`52`		`-`
	`63`	`+class Solution {`
	`64`	`+ public int findKthPositive(int[] arr, int k) {`
	`65`	`+ if (arr[0] > k) {`
	`66`	`+ return k;`
	`67`	`+ }`
	`68`	`+ int left = 0, right = arr.length;`
	`69`	`+ while (left < right) {`
	`70`	`+ int mid = (left + right) >> 1;`
	`71`	`+ int cur = mid == arr.length ? Integer.MAX_VALUE : arr[mid];`
	`72`	`+ if (cur - mid - 1 < k) {`
	`73`	`+ left = mid + 1;`
	`74`	`+ } else {`
	`75`	`+ right = mid;`
	`76`	`+ }`
	`77`	`+ }`
	`78`	`+ return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1];`
	`79`	`+ }`
	`80`	`+}`
`53`	`81`	```
`54`	`82`
`55`	`83`	`### ...`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`1`	`+class Solution {`
	`2`	`+ public int findKthPositive(int[] arr, int k) {`
	`3`	`+ if (arr[0] > k) {`
	`4`	`+ return k;`
	`5`	`+ }`
	`6`	`+ int left = 0, right = arr.length;`
	`7`	`+ while (left < right) {`
	`8`	`+ int mid = (left + right) >> 1;`
	`9`	`+ int cur = mid == arr.length ? Integer.MAX_VALUE : arr[mid];`
	`10`	`+ if (cur - mid - 1 < k) {`
	`11`	`+ left = mid + 1;`
	`12`	`+ } else {`
	`13`	`+ right = mid;`
	`14`	`+ }`
	`15`	`+ }`
	`16`	`+ return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1];`
	`17`	`+ }`
	`18`	`+}`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+class Solution:`
	`2`	`+ def findKthPositive(self, arr: List[int], k: int) -> int:`
	`3`	`+ if arr[0] > k:`
	`4`	`+ return k`
	`5`	`+ left, right = 0, len(arr)`
	`6`	`+ while left < right:`
	`7`	`+ mid = (left + right) // 2`
	`8`	`+ if arr[mid] - mid - 1 < k:`
	`9`	`+ left = mid + 1`
	`10`	`+ else:`
	`11`	`+ right = mid`
	`12`	`+ return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1]`

Comments

(0)