Mar-7

Author: geemaple

README.md

@@ -55,7 +55,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [🔲] | [9c-top.md](./list/9c-top.md) | 50/56 | 2 vips |
 | [🔲] | [灵茶山艾府.md](./list/灵茶山艾府.md) | 47/2208 | 3 vips |
 
-**Solved**: 575 problems
+**Solved**: 576 problems
 
 ## 类型/Category
 
@@ -100,7 +100,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 
 ## Math
 
-| Link | Problem(34) | Solution | Tag | Time | Space | Ref |
+| Link | Problem(35) | Solution | Tag | Time | Space | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- | ----- |
 | [Leetcode-415](https://leetcode.com/problems/add-strings/) | Add Strings | [c++](./leetcode/415.add-strings.cpp), [python3](./leetcode/415.add-strings.py) | Math | O\(N\) | O\(1\) | - |
 | [Leetcode-504](https://leetcode.com/problems/base-7/) | Base 7 | [c++](./leetcode/504.base-7.cpp), [python3](./leetcode/504.base-7.py) | Math | O\(N\) | O\(1\) | - |
@@ -109,6 +109,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [Leetcode-932](https://leetcode.com/problems/beautiful-array/) | Beautiful Array | [c++](./leetcode/932.beautiful-array.cpp), [python3](./leetcode/932.beautiful-array.py) | Math | O\(N\) | O\(N\) | - |
 | [Leetcode-1780](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/) | Check If Number Is A Sum Of Powers Of Three | [c++](./leetcode/1780.check-if-number-is-a-sum-of-powers-of-three.cpp), [python3](./leetcode/1780.check-if-number-is-a-sum-of-powers-of-three.py) | Math | O\(LogN\) | O\(1\) | - |
 | [Leetcode-3274](https://leetcode.com/problems/check-if-two-chessboard-squares-have-the-same-color/) | Check If Two Chessboard Squares Have The Same Color | [c++](./leetcode/3274.check-if-two-chessboard-squares-have-the-same-color.cpp), [python3](./leetcode/3274.check-if-two-chessboard-squares-have-the-same-color.py) | Math | O\(1\) | O\(1\) | - |
+| [Leetcode-2523](https://leetcode.com/problems/closest-prime-numbers-in-range/) | Closest Prime Numbers In Range | [c++](./leetcode/2523.closest-prime-numbers-in-range.cpp), [python3](./leetcode/2523.closest-prime-numbers-in-range.py) | Math | O\(NloglogN\) | O\(N\) | - |
 | [Leetcode-3280](https://leetcode.com/problems/convert-date-to-binary/) | Convert Date To Binary | [c++](./leetcode/3280.convert-date-to-binary.cpp), [python3](./leetcode/3280.convert-date-to-binary.py) | Math | O\(1\) | O\(1\) | - |
 | [Leetcode-2364](https://leetcode.com/problems/count-number-of-bad-pairs/) | Count Number Of Bad Pairs | [c++](./leetcode/2364.count-number-of-bad-pairs.cpp), [python3](./leetcode/2364.count-number-of-bad-pairs.py) | Math | O\(N\) | O\(N\) | - |
 | [Leetcode-204](https://leetcode.com/problems/count-primes/) | Count Primes | [c++](./leetcode/204.count-primes.cpp), [python3](./leetcode/204.count-primes.py) | Math | O\(NlogN\) | O\(N\) | - |

leetcode/2523.closest-prime-numbers-in-range.cpp

@@ -0,0 +1,73 @@
+//  Tag: Math, Number Theory
+//  Time: O(NloglogN)
+//  Space: O(N)
+//  Ref: -
+//  Note: -
+//  Video: https://youtu.be/IQw7Fmb3kUc
+
+//  Given two positive integers left and right, find the two integers num1 and num2 such that:
+//  
+//  left <= num1 < num2 <= right .
+//  Both num1 and num2 are prime numbers.
+//  num2 - num1 is the minimum amongst all other pairs satisfying the above conditions.
+//  
+//  Return the positive integer array ans = [num1, num2]. If there are multiple pairs satisfying these conditions, return the one with the smallest num1 value. If no such numbers exist, return [-1, -1].
+//   
+//  Example 1:
+//  
+//  Input: left = 10, right = 19
+//  Output: [11,13]
+//  Explanation: The prime numbers between 10 and 19 are 11, 13, 17, and 19.
+//  The closest gap between any pair is 2, which can be achieved by [11,13] or [17,19].
+//  Since 11 is smaller than 17, we return the first pair.
+//  
+//  Example 2:
+//  
+//  Input: left = 4, right = 6
+//  Output: [-1,-1]
+//  Explanation: There exists only one prime number in the given range, so the conditions cannot be satisfied.
+//  
+//   
+//  Constraints:
+//  
+//  1 <= left <= right <= 106
+//  
+//   
+//  
+//  
+
+class Solution {
+public:
+    vector<int> closestPrimes(int left, int right) {
+        vector<bool> primes = getPrimes(right + 1);
+        vector<int> res = {-1, -1};
+        int pre = -1;
+        int cur = -1;
+        for (int x = left; x <= right; x++) {
+            if (primes[x]) {
+                pre = cur;
+                cur = x;
+            }
+
+            if (pre > 0 && (res[0] == -1 || cur - pre < res[1] - res[0])) {
+                res = {pre, cur};
+            }
+        }
+        return res;
+    }
+
+    vector<bool> getPrimes(int n) {
+        vector<bool> primes(n, true);
+        primes[0] = primes[1] = false;
+
+        for (int i = 2; i < int(sqrt(n)) + 1; i++) {
+            if (primes[i]) {
+                for (int j = i * i; j < n; j+=i) {
+                    primes[j] = false;
+                }
+            }
+        }
+
+        return primes;
+    }
+};

leetcode/2523.closest-prime-numbers-in-range.py

@@ -0,0 +1,66 @@
+#  Tag: Math, Number Theory
+#  Time: O(NloglogN)
+#  Space: O(N)
+#  Ref: -
+#  Note: -
+#  Video: https://youtu.be/IQw7Fmb3kUc
+
+#  Given two positive integers left and right, find the two integers num1 and num2 such that:
+#  
+#  left <= num1 < num2 <= right .
+#  Both num1 and num2 are prime numbers.
+#  num2 - num1 is the minimum amongst all other pairs satisfying the above conditions.
+#  
+#  Return the positive integer array ans = [num1, num2]. If there are multiple pairs satisfying these conditions, return the one with the smallest num1 value. If no such numbers exist, return [-1, -1].
+#   
+#  Example 1:
+#  
+#  Input: left = 10, right = 19
+#  Output: [11,13]
+#  Explanation: The prime numbers between 10 and 19 are 11, 13, 17, and 19.
+#  The closest gap between any pair is 2, which can be achieved by [11,13] or [17,19].
+#  Since 11 is smaller than 17, we return the first pair.
+#  
+#  Example 2:
+#  
+#  Input: left = 4, right = 6
+#  Output: [-1,-1]
+#  Explanation: There exists only one prime number in the given range, so the conditions cannot be satisfied.
+#  
+#   
+#  Constraints:
+#  
+#  1 <= left <= right <= 106
+#  
+#   
+#  
+#  
+
+class Solution:
+    def closestPrimes(self, left: int, right: int) -> List[int]:
+        primes = self.getPrimes(right + 1)
+        cur = None  
+        pre = None
+        res = [-1, -1]
+
+        for x in range(left, right + 1):
+            if primes[x]:
+                pre = cur
+                cur = x
+       
+            if pre is not None:
+                if res[0] == - 1 or cur - pre < res[1] - res[0]:
+                    res = [pre, cur]
+
+        return res if res else [-1, -1]
+            
+    def getPrimes(self, n):
+        primes = [True for i in range(n)]
+        primes[0] = primes[1] = False
+
+        for i in range(2, int(n ** 0.5) + 1):
+            if primes[i]:
+                for j in range(i * i, n, i):
+                    primes[j] = False
+
+        return primes