feat: add rust solution to lc problem: No.3307 (#4530)

No.3307.Find the K-th Character in String Game II

Author: yanglbme

solution/3300-3399/3307.Find the K-th Character in String Game II/README.md

@@ -226,6 +226,31 @@ function kthCharacter(k: number, operations: number[]): string {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn kth_character(mut k: i64, operations: Vec<i32>) -> char {
+        let mut n = 1i64;
+        let mut i = 0;
+        while n < k {
+            n *= 2;
+            i += 1;
+        }
+        let mut d = 0;
+        while n > 1 {
+            if k > n / 2 {
+                k -= n / 2;
+                d += operations[i - 1] as i64;
+            }
+            n /= 2;
+            i -= 1;
+        }
+        ((b'a' + (d % 26) as u8) as char)
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3307.Find the K-th Character in String Game II/README_EN.md

@@ -223,6 +223,31 @@ function kthCharacter(k: number, operations: number[]): string {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn kth_character(mut k: i64, operations: Vec<i32>) -> char {
+        let mut n = 1i64;
+        let mut i = 0;
+        while n < k {
+            n *= 2;
+            i += 1;
+        }
+        let mut d = 0;
+        while n > 1 {
+            if k > n / 2 {
+                k -= n / 2;
+                d += operations[i - 1] as i64;
+            }
+            n /= 2;
+            i -= 1;
+        }
+        ((b'a' + (d % 26) as u8) as char)
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3307.Find the K-th Character in String Game II/Solution.rs

@@ -0,0 +1,20 @@
+impl Solution {
+    pub fn kth_character(mut k: i64, operations: Vec<i32>) -> char {
+        let mut n = 1i64;
+        let mut i = 0;
+        while n < k {
+            n *= 2;
+            i += 1;
+        }
+        let mut d = 0;
+        while n > 1 {
+            if k > n / 2 {
+                k -= n / 2;
+                d += operations[i - 1] as i64;
+            }
+            n /= 2;
+            i -= 1;
+        }
+        ((b'a' + (d % 26) as u8) as char)
+    }
+}

solution/3500-3599/3596.Minimum Cost Path with Alternating Directions I/README_EN.md

@@ -85,7 +85,7 @@ Due to the movement rules given in the problem, in fact, only the following thre
 
 For all other cases, it is impossible to reach the target cell, so return $-1$.
 
-The time complexity is $O(1)$, and the space complexity is
+The time complexity is $O(1)$, and the space complexity is $O(1)$.
 
 <!-- tabs:start -->