doocs · yanglbme · May 5, 2026 · May 5, 2026
diff --git a/solution/0000-0099/0061.Rotate List/Soution.rs b/solution/0000-0099/0061.Rotate List/Soution.rs
diff --git a/solution/0000-0099/0061.Rotate List/Soution.ts b/solution/0000-0099/0061.Rotate List/Soution.ts
diff --git a/solution/2500-2599/2539.Count the Number of Good Subsequences/Solutoin.cpp b/solution/2500-2599/2539.Count the Number of Good Subsequences/Solutoin.cpp
diff --git a/solution/2700-2799/2729.Check if The Number is Fascinating/README.md b/solution/2700-2799/2729.Check if The Number is Fascinating/README.md
@@ -158,55 +158,4 @@ impl Solution {
 
 <!-- solution:end -->
 
-<!-- solution:start -->
-
-### 方法二
-
-<!-- tabs:start -->
-
-#### Rust
-
-```rust
-use std::collections::HashMap;
-
-impl Solution {
-    pub fn is_fascinating(mut n: i32) -> bool {
-        let mut i = n * 2;
-        let mut j = n * 3;
-
-        let mut hash = HashMap::new();
-
-        while n != 0 {
-            let cnt = hash.entry(n % 10).or_insert(0);
-            *cnt += 1;
-            n /= 10;
-        }
-
-        while i != 0 {
-            let cnt = hash.entry(i % 10).or_insert(0);
-            *cnt += 1;
-            i /= 10;
-        }
-
-        while j != 0 {
-            let cnt = hash.entry(j % 10).or_insert(0);
-            *cnt += 1;
-            j /= 10;
-        }
-
-        for k in 1..=9 {
-            if !hash.contains_key(&k) || hash[&k] > 1 {
-                return false;
-            }
-        }
-
-        !hash.contains_key(&0)
-    }
-}
-```
-
-<!-- tabs:end -->
-
-<!-- solution:end -->
-
 <!-- problem:end -->
diff --git a/solution/2700-2799/2729.Check if The Number is Fascinating/README_EN.md b/solution/2700-2799/2729.Check if The Number is Fascinating/README_EN.md
@@ -61,7 +61,11 @@ tags:
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Simulation
+
+According to the problem description, we concatenate $n$, $2 \times n$, and $3 \times n$ into a string $s$, and then check whether $s$ contains each digit from $1$ to $9$ exactly once and does not contain any $0$.
+
+The time complexity is $O(\log n)$, and the space complexity is $O(\log n)$. Here, $n$ is the given integer.
 
 <!-- tabs:start -->
 
@@ -154,55 +158,4 @@ impl Solution {
 
 <!-- solution:end -->
 
-<!-- solution:start -->
-
-### Solution 2
-
-<!-- tabs:start -->
-
-#### Rust
-
-```rust
-use std::collections::HashMap;
-
-impl Solution {
-    pub fn is_fascinating(mut n: i32) -> bool {
-        let mut i = n * 2;
-        let mut j = n * 3;
-
-        let mut hash = HashMap::new();
-
-        while n != 0 {
-            let cnt = hash.entry(n % 10).or_insert(0);
-            *cnt += 1;
-            n /= 10;
-        }
-
-        while i != 0 {
-            let cnt = hash.entry(i % 10).or_insert(0);
-            *cnt += 1;
-            i /= 10;
-        }
-
-        while j != 0 {
-            let cnt = hash.entry(j % 10).or_insert(0);
-            *cnt += 1;
-            j /= 10;
-        }
-
-        for k in 1..=9 {
-            if !hash.contains_key(&k) || hash[&k] > 1 {
-                return false;
-            }
-        }
-
-        !hash.contains_key(&0)
-    }
-}
-```
-
-<!-- tabs:end -->
-
-<!-- solution:end -->
-
 <!-- problem:end -->
diff --git a/solution/2700-2799/2729.Check if The Number is Fascinating/Solution2.rs b/solution/2700-2799/2729.Check if The Number is Fascinating/Solution2.rs
diff --git a/solution/2700-2799/2729.Check if The Number is Fascinating/Solutions.rs b/solution/2700-2799/2729.Check if The Number is Fascinating/Solutions.rs
diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/Soution.go b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Soution.go
diff --git a/solution/2800-2899/2859.Sum of Values at Indices With K Set Bits/Solultion.java b/solution/2800-2899/2859.Sum of Values at Indices With K Set Bits/Solultion.java