2601. Prime Subtraction Operation
## 思路
假如新递增阵列的前一个值是prev,
下一个值 num-prime 要大于 prev
=> 先建质数表, 扫阵列用Binary Search找最大可能的prime 并更新prev
## Code
```python
class Solution:
def primeSubOperation(self, nums: List[int]) -> bool:
is_prime = [True] * 1001
is_prime[0] = is_prime[1] = False
for i in range(2, int(sqrt(1001)) + 1):
if not is_prime[i]:
continue
for j in range(2*i, 1001, i):
is_prime[j] = False
primes = [i for i in range(2, 1001) if is_prime[i]]
prev = 0
for num in nums:
if num <= prev:
return False
idx = bisect_left(primes, num - prev) - 1
prev = num - primes[idx] if idx != -1 else num
return True
```

大师

大师

大师

剩我什么都不会了

酷 没想到可以二分搜