-
Notifications
You must be signed in to change notification settings - Fork 0
/
1539. Kth Missing Positive Number
63 lines (43 loc) · 1.35 KB
/
1539. Kth Missing Positive Number
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*
Given an array arr of positive integers sorted in a strictly increasing order, and an integer k.
Find the kth positive integer that is missing from this array.
Example 1:
Input: arr = [2,3,4,7,11], k = 5
Output: 9
Explanation: The missing positive integers are [1,5,6,8,9,10,12,13,...]. The 5th missing positive integer is 9.
Example 2:
Input: arr = [1,2,3,4], k = 2
Output: 6
Explanation: The missing positive integers are [5,6,7,...]. The 2nd missing positive integer is 6.
Constraints:
1 <= arr.length <= 1000
1 <= arr[i] <= 1000
1 <= k <= 1000
arr[i] < arr[j] for 1 <= i < j <= arr.length
*/
public class Solution {
public int FindKthPositive(int[] array, int k) {
int count = 0;
var list = new List<int>();
for (int i = 1; i <=array.Max(); i++)
{
if(count == k)
{
break;
}
if (!array.Contains(i))
{
list.Add(i);
count++;
}
}
if (count == k)
{
return list.Max();
}
else
{
int counter = list.Count == 0 || list.Max() < array.Max() ? array.Max() : list.Max();
return counter+ (k-count);
}
}}