Kth Missing Positive Number LeetCode solution in Java

1
class Solution {
2
  public int findKthPositive(int[] arr, int k) {
3
    if (arr[0] > k) {
4
      return k;
5
    }
6

7
    for (int i = 0; i < arr.length; i++) {
8
      if (arr[i] <= k) {
9
        k++;
10
      } else {
11
        break;
12
      }
13
    }
14
    return k;
15
  }
16
}