Skip to content

Commit 6be6442

Browse files
solves kth missing positive number
1 parent 32b45fd commit 6be6442

File tree

2 files changed

+20
-1
lines changed

2 files changed

+20
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -387,5 +387,5 @@
387387
| 1523 | [Count Odd Numbers In Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range) | [![Java](assets/java.png)](src/CountOddNumbersInIntervalRange.java) | |
388388
| 1528 | [Shuffle Strings](https://leetcode.com/problems/shuffle-string) | [![Java](assets/java.png)](src/ShuffleString.java) | |
389389
| 1534 | [Count Good Triplets](https://leetcode.com/problems/count-good-triplets) | [![Java](assets/java.png)](src/CountGoodTriplets.java) | |
390-
| 1539 | [Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number) | | |
390+
| 1539 | [Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number) | [![Java](assets/java.png)](src/KthMissingPositiveNumber.java) | |
391391
| 1544 | [Make The String Great](https://leetcode.com/problems/make-the-string-great) | | |

src/KthMissingPositiveNumber.java

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
// https://leetcode.com/problems/kth-missing-positive-number
2+
// T: O(n)
3+
// S: O(1)
4+
5+
public class KthMissingPositiveNumber {
6+
public int findKthPositive(int[] arr, int k) {
7+
int pointer = 1, missing = 0;
8+
for (int index = 0, current = arr[index]; missing < k ; ) {
9+
if (pointer < current) {
10+
missing++;
11+
} else {
12+
index++;
13+
current = index == arr.length ? Integer.MAX_VALUE : arr[index];
14+
}
15+
pointer++;
16+
}
17+
return pointer - 1;
18+
}
19+
}

0 commit comments

Comments
 (0)