feat: add solutions to lc problem: No.2601 (doocs#3750)

Author: rain84

solution/2600-2699/2601.Prime Subtraction Operation/README.md

@@ -274,4 +274,86 @@ function primeSubOperation(nums: number[]): boolean {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### 方法二：预处理素数
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function primeSubOperation(nums: number[]): boolean {
+    const p: number[] = [];
+    const max = Math.max(...nums);
+
+    for (let i = 2; i < max; i++) {
+        let isPrime = true;
+
+        for (const x of p) {
+            if (i % x === 0) {
+                isPrime = false;
+                break;
+            }
+        }
+
+        while (isPrime && p.length <= i) {
+            p.push(i);
+        }
+    }
+
+    for (let i = nums.length - 2; i >= 0; i--) {
+        if (nums[i] < nums[i + 1]) continue;
+
+        const [x, next] = [nums[i], nums[i + 1]];
+        const prime = p[x - next + 1];
+
+        if (!prime || prime >= x) return false;
+        nums[i] -= prime;
+    }
+
+    return true;
+}
+```
+
+#### JavaScript
+
+```js
+function primeSubOperation(nums) {
+    const p = [];
+    const max = Math.max(...nums);
+
+    for (let i = 2; i < max; i++) {
+        let isPrime = true;
+
+        for (const x of p) {
+            if (i % x === 0) {
+                isPrime = false;
+                break;
+            }
+        }
+
+        while (isPrime && p.length <= i) {
+            p.push(i);
+        }
+    }
+
+    for (let i = nums.length - 2; i >= 0; i--) {
+        if (nums[i] < nums[i + 1]) continue;
+
+        const [x, next] = [nums[i], nums[i + 1]];
+        const prime = p[x - next + 1];
+
+        if (!prime || prime >= x) return false;
+        nums[i] -= prime;
+    }
+
+    return true;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/2600-2699/2601.Prime Subtraction Operation/README_EN.md

@@ -271,4 +271,86 @@ function primeSubOperation(nums: number[]): boolean {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Preprocessing prime numbers
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function primeSubOperation(nums: number[]): boolean {
+    const p: number[] = [];
+    const max = Math.max(...nums);
+
+    for (let i = 2; i < max; i++) {
+        let isPrime = true;
+
+        for (const x of p) {
+            if (i % x === 0) {
+                isPrime = false;
+                break;
+            }
+        }
+
+        while (isPrime && p.length <= i) {
+            p.push(i);
+        }
+    }
+
+    for (let i = nums.length - 2; i >= 0; i--) {
+        if (nums[i] < nums[i + 1]) continue;
+
+        const [x, next] = [nums[i], nums[i + 1]];
+        const prime = p[x - next + 1];
+
+        if (!prime || prime >= x) return false;
+        nums[i] -= prime;
+    }
+
+    return true;
+}
+```
+
+#### JavaScript
+
+```js
+function primeSubOperation(nums) {
+    const p = [];
+    const max = Math.max(...nums);
+
+    for (let i = 2; i < max; i++) {
+        let isPrime = true;
+
+        for (const x of p) {
+            if (i % x === 0) {
+                isPrime = false;
+                break;
+            }
+        }
+
+        while (isPrime && p.length <= i) {
+            p.push(i);
+        }
+    }
+
+    for (let i = nums.length - 2; i >= 0; i--) {
+        if (nums[i] < nums[i + 1]) continue;
+
+        const [x, next] = [nums[i], nums[i + 1]];
+        const prime = p[x - next + 1];
+
+        if (!prime || prime >= x) return false;
+        nums[i] -= prime;
+    }
+
+    return true;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/2600-2699/2601.Prime Subtraction Operation/Solution2.js

@@ -0,0 +1,31 @@
+function primeSubOperation(nums) {
+    const p = [];
+    const max = Math.max(...nums);
+
+    for (let i = 2; i < max; i++) {
+        let isPrime = true;
+
+        for (const x of p) {
+            if (i % x === 0) {
+                isPrime = false;
+                break;
+            }
+        }
+
+        while (isPrime && p.length <= i) {
+            p.push(i);
+        }
+    }
+
+    for (let i = nums.length - 2; i >= 0; i--) {
+        if (nums[i] < nums[i + 1]) continue;
+
+        const [x, next] = [nums[i], nums[i + 1]];
+        const prime = p[x - next + 1];
+
+        if (!prime || prime >= x) return false;
+        nums[i] -= prime;
+    }
+
+    return true;
+}

solution/2600-2699/2601.Prime Subtraction Operation/Solution2.ts

@@ -0,0 +1,31 @@
+function primeSubOperation(nums: number[]): boolean {
+    const p: number[] = [];
+    const max = Math.max(...nums);
+
+    for (let i = 2; i < max; i++) {
+        let isPrime = true;
+
+        for (const x of p) {
+            if (i % x === 0) {
+                isPrime = false;
+                break;
+            }
+        }
+
+        while (isPrime && p.length <= i) {
+            p.push(i);
+        }
+    }
+
+    for (let i = nums.length - 2; i >= 0; i--) {
+        if (nums[i] < nums[i + 1]) continue;
+
+        const [x, next] = [nums[i], nums[i + 1]];
+        const prime = p[x - next + 1];
+
+        if (!prime || prime >= x) return false;
+        nums[i] -= prime;
+    }
+
+    return true;
+}