feat: add rust solution to lc problems: No.0643,1052

- No.0643.Maximum Average Subarray I
- No.1052.Grumpy Bookstore Owner

Author: YangFong

solution/0600-0699/0643.Maximum Average Subarray I/README.md

@@ -103,6 +103,24 @@ function findMaxAverage(nums: number[], k: number): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_max_average(nums: Vec<i32>, k: i32) -> f64 {
+        let k = k as usize;
+        let n = nums.len();
+        let mut sum = nums.iter().take(k).sum::<i32>();
+        let mut max = sum;
+        for i in k..n {
+            sum += nums[i] - nums[i - k];
+            max = max.max(sum);
+        }
+        f64::from(max) / f64::from(k as i32)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0600-0699/0643.Maximum Average Subarray I/README_EN.md

@@ -91,6 +91,24 @@ function findMaxAverage(nums: number[], k: number): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_max_average(nums: Vec<i32>, k: i32) -> f64 {
+        let k = k as usize;
+        let n = nums.len();
+        let mut sum = nums.iter().take(k).sum::<i32>();
+        let mut max = sum;
+        for i in k..n {
+            sum += nums[i] - nums[i - k];
+            max = max.max(sum);
+        }
+        f64::from(max) / f64::from(k as i32)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0600-0699/0643.Maximum Average Subarray I/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+    pub fn find_max_average(nums: Vec<i32>, k: i32) -> f64 {
+        let k = k as usize;
+        let n = nums.len();
+        let mut sum = nums.iter().take(k).sum::<i32>();
+        let mut max = sum;
+        for i in k..n {
+            sum += nums[i] - nums[i - k];
+            max = max.max(sum);
+        }
+        f64::from(max) / f64::from(k as i32)
+    }
+}

solution/1000-1099/1052.Grumpy Bookstore Owner/README.md

@@ -105,6 +105,42 @@ class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_satisfied(customers: Vec<i32>, grumpy: Vec<i32>, minutes: i32) -> i32 {
+        let k = minutes as usize;
+        let n = customers.len();
+
+        let mut sum = 0;
+        for i in 0..k {
+            if grumpy[i] == 1 {
+                sum += customers[i];
+            }
+        }
+        let mut max = sum;
+        for i in k..n {
+            if grumpy[i - k] == 1 {
+                sum -= customers[i - k];
+            }
+            if grumpy[i] == 1 {
+                sum += customers[i];
+            }
+            max = max.max(sum);
+        }
+
+        sum = 0;
+        for i in 0..n {
+            if grumpy[i] == 0 {
+                sum += customers[i];
+            }
+        }
+        sum + max
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1052.Grumpy Bookstore Owner/README_EN.md

@@ -85,6 +85,42 @@ class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_satisfied(customers: Vec<i32>, grumpy: Vec<i32>, minutes: i32) -> i32 {
+        let k = minutes as usize;
+        let n = customers.len();
+
+        let mut sum = 0;
+        for i in 0..k {
+            if grumpy[i] == 1 {
+                sum += customers[i];
+            }
+        }
+        let mut max = sum;
+        for i in k..n {
+            if grumpy[i - k] == 1 {
+                sum -= customers[i - k];
+            }
+            if grumpy[i] == 1 {
+                sum += customers[i];
+            }
+            max = max.max(sum);
+        }
+
+        sum = 0;
+        for i in 0..n {
+            if grumpy[i] == 0 {
+                sum += customers[i];
+            }
+        }
+        sum + max
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1052.Grumpy Bookstore Owner/Solution.rs

@@ -0,0 +1,31 @@
+impl Solution {
+    pub fn max_satisfied(customers: Vec<i32>, grumpy: Vec<i32>, minutes: i32) -> i32 {
+        let k = minutes as usize;
+        let n = customers.len();
+
+        let mut sum = 0;
+        for i in 0..k {
+            if grumpy[i] == 1 {
+                sum += customers[i];
+            }
+        }
+        let mut max = sum;
+        for i in k..n {
+            if grumpy[i - k] == 1 {
+                sum -= customers[i - k];
+            }
+            if grumpy[i] == 1 {
+                sum += customers[i];
+            }
+            max = max.max(sum);
+        }
+
+        sum = 0;
+        for i in 0..n {
+            if grumpy[i] == 0 {
+                sum += customers[i];
+            }
+        }
+        sum + max
+    }
+}