feat: add solutions to lc problem: No.1539.Kth Missing Positive Number

solution/1500-1599/1539.Kth Missing Positive Number/README.md

@@ -49,15 +49,43 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findKthPositive(self, arr: List[int], k: int) -> int:
+        if arr[0] > k:
+            return k
+        left, right = 0, len(arr)
+        while left < right:
+            mid = (left + right) // 2
+            if arr[mid] - mid - 1 < k:
+                left = mid + 1
+            else:
+                right = mid
+        return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int findKthPositive(int[] arr, int k) {
+        if (arr[0] > k) {
+            return k;
+        }
+        int left = 0, right = arr.length;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            int cur = mid == arr.length ? Integer.MAX_VALUE : arr[mid];
+            if (cur - mid - 1 < k) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1];
+    }
+}
 ```
 
 ### **...**

solution/1500-1599/1539.Kth Missing Positive Number/README_EN.md

@@ -43,13 +43,41 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findKthPositive(self, arr: List[int], k: int) -> int:
+        if arr[0] > k:
+            return k
+        left, right = 0, len(arr)
+        while left < right:
+            mid = (left + right) // 2
+            if arr[mid] - mid - 1 < k:
+                left = mid + 1
+            else:
+                right = mid
+        return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1]
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int findKthPositive(int[] arr, int k) {
+        if (arr[0] > k) {
+            return k;
+        }
+        int left = 0, right = arr.length;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            int cur = mid == arr.length ? Integer.MAX_VALUE : arr[mid];
+            if (cur - mid - 1 < k) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1];
+    }
+}
 ```
 
 ### **...**

solution/1500-1599/1539.Kth Missing Positive Number/Solution.java

@@ -0,0 +1,18 @@
+class Solution {
+    public int findKthPositive(int[] arr, int k) {
+        if (arr[0] > k) {
+            return k;
+        }
+        int left = 0, right = arr.length;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            int cur = mid == arr.length ? Integer.MAX_VALUE : arr[mid];
+            if (cur - mid - 1 < k) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1];
+    }
+}

solution/1500-1599/1539.Kth Missing Positive Number/Solution.py

@@ -0,0 +1,12 @@
+class Solution:
+    def findKthPositive(self, arr: List[int], k: int) -> int:
+        if arr[0] > k:
+            return k
+        left, right = 0, len(arr)
+        while left < right:
+            mid = (left + right) // 2
+            if arr[mid] - mid - 1 < k:
+                left = mid + 1
+            else:
+                right = mid
+        return k - (arr[left - 1] - (left - 1) - 1) + arr[left - 1]