This approach involves iterating through the array and maintaining a counter for missing positive integers. We start with the first positive number, which is 1, and determine if it is missing by comparing it to the current element in the array. If the number is missing, we decrement our k value. When k reaches zero, we have found our k-th missing number.
Time Complexity: O(n + k), where n is the length of the array. Space Complexity: O(1), as we are using constant extra space.
1#include <vector>
2using namespace std;
3
4int findKthPositive(vector<int>& arr, int k) {
5 int missing_count = 0;
6 int current = 1;
7 int i = 0;
8 while (missing_count < k) {
9 if (i < arr.size() && arr[i] == current) {
10 i++;
11 } else {
12 missing_count++;
13 if (missing_count == k) return current;
14 }
15 current++;
16 }
17 return -1; // this line is never reached
18}
19
20int main() {
21 vector<int> arr = {2, 3, 4, 7, 11};
22 int k = 5;
23 printf("%d\n", findKthPositive(arr, k));
24 return 0;
25}This solution uses a similar approach as the C solution. We iterate through the array, checking each expected number against the current number in the array. If they match, it's not missing, so we continue. Otherwise, we consider it as missing and check if it matches k.
By using binary search, a more efficient solution can be developed that reduces unnecessary checks. The key observation is that the number of missing integers before arr[i] can be calculated as arr[i] - (i + 1), which helps in deducing the position of the k-th missing number without iterating through every integer.
Time Complexity: O(log n), Space Complexity: O(1).
1public class Solution {
2 public int findKthPositive(int[] arr, int k) {
3 int left = 0, right = arr.length - 1;
4 while (left <= right) {
5 int mid = left + (right - left) / 2;
6 if (arr[mid] - (mid + 1) < k) {
7 left = mid + 1;
8 } else {
9 right = mid - 1;
10 }
11 }
12 return left + k;
13 }
14 public static void main(String[] args) {
15 int[] arr = {2, 3, 4, 7, 11};
16 Solution solution = new Solution();
17 System.out.println(solution.findKthPositive(arr, 5));
18 }
19}This Java code implements a binary search to quickly find the k-th missing number by calculating the number of missing numbers up to the midpoint and adjusting search range based on that.