chore: add rust formatter

.github/workflows/pr-checker.yml

@@ -19,7 +19,7 @@ jobs:
 
             我们项目中各种编程语言代码（包括文档）所采用的格式化工具不同，提交 pr 之前必须确保代码、文档正确格式化。
 
-            -   .{md,js,ts,php,sql} 采用 prettier
+            -   .{md,js,ts,php,sql,rs} 采用 prettier
             -   .{c,cpp,java} 采用 clang-format
             -   .{py} 采用 black
             -   .{go} 采用 gofmt
@@ -47,7 +47,7 @@ jobs:
 
             We use different formatting tools for various programming languages (including documentation) in our project. You must ensure that the code and documentation are correctly formatted before submitting a pr.
 
-            -   .{md,js,ts,php,sql} use prettier
+            -   .{md,js,ts,php,sql,rs} use prettier
             -   .{c,cpp,java} use clang-format
             -   .{py} use black
             -   .{go} use gofmt

.github/workflows/prettier.yml

@@ -25,7 +25,7 @@ jobs:
       - name: Run prettier
         run: |
           git config --global core.quotepath off
-          changed_files=$(git diff --name-only "${{ github.event.pull_request.base.sha }}" | grep -E '\.md$|\.js$|\.ts$|\.php|\.sql$' || true)
+          changed_files=$(git diff --name-only "${{ github.event.pull_request.base.sha }}" | grep -E '\.js$|\.ts$|\.php$|\.sql$|\.rs$|\.md$' || true)
           if [ -n "$changed_files" ]; then
             echo "Running prettier on the changed files"
             echo "$changed_files" | xargs -d '\n' npx prettier --write

basic/sorting/HeapSort/README.md

@@ -207,13 +207,19 @@ fn sink(nums: &mut Vec<i32>, mut i: usize, n: usize) {
 fn main() -> io::Result<()> {
     let mut s = String::new();
     io::stdin().read_line(&mut s)?;
-    let s: Vec<usize> = s.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let s: Vec<usize> = s
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
     // let n = s[0];
     let m = s[1];
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     heap_sort(&mut nums);
     for num in nums.iter().take(m) {

basic/sorting/InsertionSort/InsertionSort.rs

@@ -3,7 +3,7 @@ fn insertion_sort(nums: &mut Vec<i32>) {
     for i in 1..n {
         let mut j = i - 1;
         let temp = nums[i];
-        while j >= 0 as usize && nums[j] > temp {
+        while j >= (0 as usize) && nums[j] > temp {
             nums[j + 1] = nums[j];
             j -= 1;
         }

basic/sorting/InsertionSort/README.md

@@ -136,7 +136,7 @@ fn insertion_sort(nums: &mut Vec<i32>) {
     for i in 1..n {
         let mut j = i - 1;
         let temp = nums[i];
-        while j >= 0 as usize && nums[j] > temp {
+        while j >= (0 as usize) && nums[j] > temp {
             nums[j + 1] = nums[j];
             j -= 1;
         }

basic/sorting/MergeSort/Main.rs

@@ -43,7 +43,10 @@ fn main() -> io::Result<()> {
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     merge_sort(&mut nums, 0, n - 1);
     for num in nums.iter() {

basic/sorting/MergeSort/README.md

@@ -359,7 +359,10 @@ fn main() -> io::Result<()> {
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     merge_sort(&mut nums, 0, n - 1);
     for num in nums.iter() {

basic/sorting/QuickSort/Main.rs

@@ -37,7 +37,10 @@ fn main() -> io::Result<()> {
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     quick_sort(&mut nums, 0, n - 1);
     for num in nums.iter() {

basic/sorting/QuickSort/README.md

@@ -280,7 +280,10 @@ fn main() -> io::Result<()> {
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     quick_sort(&mut nums, 0, n - 1);
     for num in nums.iter() {

basic/sorting/ShellSort/README.md

@@ -104,7 +104,7 @@ fn shell_sort(nums: &mut Vec<i32>) {
         for i in gap..n {
             let mut j = i - gap;
             let temp = nums[i];
-            while j >= 0 as usize && nums[j] > temp {
+            while j >= (0 as usize) && nums[j] > temp {
                 nums[j + gap] = nums[j];
                 j -= gap;
             }

basic/sorting/ShellSort/ShellSort.rs

@@ -5,7 +5,7 @@ fn shell_sort(nums: &mut Vec<i32>) {
         for i in gap..n {
             let mut j = i - gap;
             let temp = nums[i];
-            while j >= 0 as usize && nums[j] > temp {
+            while j >= (0 as usize) && nums[j] > temp {
                 nums[j + gap] = nums[j];
                 j -= gap;
             }

lcci/01.03.String to URL/README.md

@@ -139,11 +139,7 @@ impl Solution {
         s.chars()
             .take(length as usize)
             .map(|c| {
-                if c == ' ' {
-                    "%20".to_string()
-                } else {
-                    c.to_string()
-                }
+                if c == ' ' { "%20".to_string() } else { c.to_string() }
             })
             .collect()
     }

lcci/01.03.String to URL/README_EN.md

@@ -136,11 +136,7 @@ impl Solution {
         s.chars()
             .take(length as usize)
             .map(|c| {
-                if c == ' ' {
-                    "%20".to_string()
-                } else {
-                    c.to_string()
-                }
+                if c == ' ' { "%20".to_string() } else { c.to_string() }
             })
             .collect()
     }

lcci/01.09.String Rotation/README.md

@@ -142,7 +142,7 @@ impl Solution {
             }
             if is_pass {
                 return true;
-            };
+            }
         }
         false
     }

lcci/01.09.String Rotation/README_EN.md

@@ -115,7 +115,7 @@ impl Solution {
             }
             if is_pass {
                 return true;
-            };
+            }
         }
         false
     }

lcci/02.05.Sum Lists/README.md

@@ -236,7 +236,7 @@ function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | nul
 impl Solution {
     pub fn add_two_numbers(
         mut l1: Option<Box<ListNode>>,
-        mut l2: Option<Box<ListNode>>,
+        mut l2: Option<Box<ListNode>>
     ) -> Option<Box<ListNode>> {
         let mut dummy = Some(Box::new(ListNode::new(0)));
         let mut cur = dummy.as_mut();

lcci/02.05.Sum Lists/README_EN.md

@@ -231,7 +231,7 @@ function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | nul
 impl Solution {
     pub fn add_two_numbers(
         mut l1: Option<Box<ListNode>>,
-        mut l2: Option<Box<ListNode>>,
+        mut l2: Option<Box<ListNode>>
     ) -> Option<Box<ListNode>> {
         let mut dummy = Some(Box::new(ListNode::new(0)));
         let mut cur = dummy.as_mut();

lcci/02.05.Sum Lists/Solution.rs

@@ -1,7 +1,7 @@
 impl Solution {
     pub fn add_two_numbers(
         mut l1: Option<Box<ListNode>>,
-        mut l2: Option<Box<ListNode>>,
+        mut l2: Option<Box<ListNode>>
     ) -> Option<Box<ListNode>> {
         let mut dummy = Some(Box::new(ListNode::new(0)));
         let mut cur = dummy.as_mut();

lcci/03.02.Min Stack/README.md

@@ -236,13 +236,11 @@ struct MinStack {
     min_stack: VecDeque<i32>,
 }
 
-
 /**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl MinStack {
-
     /** initialize your data structure here. */
     fn new() -> Self {
         Self { stack: VecDeque::new(), min_stack: VecDeque::new() }
@@ -269,9 +267,7 @@ impl MinStack {
     fn get_min(&self) -> i32 {
         *self.min_stack.back().unwrap()
     }
-}
-
-/**
+}/**
  * Your MinStack object will be instantiated and called as such:
  * let obj = MinStack::new();
  * obj.push(x);

lcci/03.02.Min Stack/README_EN.md

@@ -236,13 +236,11 @@ struct MinStack {
     min_stack: VecDeque<i32>,
 }
 
-
 /**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl MinStack {
-
     /** initialize your data structure here. */
     fn new() -> Self {
         Self { stack: VecDeque::new(), min_stack: VecDeque::new() }
@@ -269,9 +267,7 @@ impl MinStack {
     fn get_min(&self) -> i32 {
         *self.min_stack.back().unwrap()
     }
-}
-
-/**
+}/**
  * Your MinStack object will be instantiated and called as such:
  * let obj = MinStack::new();
  * obj.push(x);

lcci/03.02.Min Stack/Solution.rs

@@ -4,13 +4,11 @@ struct MinStack {
     min_stack: VecDeque<i32>,
 }
 
-
 /**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl MinStack {
-
     /** initialize your data structure here. */
     fn new() -> Self {
         Self { stack: VecDeque::new(), min_stack: VecDeque::new() }
@@ -37,13 +35,11 @@ impl MinStack {
     fn get_min(&self) -> i32 {
         *self.min_stack.back().unwrap()
     }
-}
-
-/**
+}/**
  * Your MinStack object will be instantiated and called as such:
  * let obj = MinStack::new();
  * obj.push(x);
  * obj.pop();
  * let ret_3: i32 = obj.top();
  * let ret_4: i32 = obj.get_min();
- */
+ */

lcci/03.05.Sort of Stacks/README.md

@@ -246,16 +246,14 @@ func (s *SortedStack) IsEmpty() bool {
 ```rust
 use std::collections::VecDeque;
 struct SortedStack {
-    stack: VecDeque<i32>
+    stack: VecDeque<i32>,
 }
 
-
 /**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl SortedStack {
-
     fn new() -> Self {
         Self { stack: VecDeque::new() }
     }
@@ -281,9 +279,7 @@ impl SortedStack {
     fn is_empty(&self) -> bool {
         self.stack.is_empty()
     }
-}
-
-/**
+}/**
  * Your SortedStack object will be instantiated and called as such:
  * let obj = SortedStack::new();
  * obj.push(val);

lcci/03.05.Sort of Stacks/README_EN.md

@@ -251,16 +251,14 @@ func (s *SortedStack) IsEmpty() bool {
 ```rust
 use std::collections::VecDeque;
 struct SortedStack {
-    stack: VecDeque<i32>
+    stack: VecDeque<i32>,
 }
 
-
 /**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl SortedStack {
-
     fn new() -> Self {
         Self { stack: VecDeque::new() }
     }
@@ -286,9 +284,7 @@ impl SortedStack {
     fn is_empty(&self) -> bool {
         self.stack.is_empty()
     }
-}
-
-/**
+}/**
  * Your SortedStack object will be instantiated and called as such:
  * let obj = SortedStack::new();
  * obj.push(val);

lcci/03.05.Sort of Stacks/Solution.rs

@@ -1,15 +1,13 @@
 use std::collections::VecDeque;
 struct SortedStack {
-    stack: VecDeque<i32>
+    stack: VecDeque<i32>,
 }
 
-
 /**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl SortedStack {
-
     fn new() -> Self {
         Self { stack: VecDeque::new() }
     }
@@ -35,13 +33,11 @@ impl SortedStack {
     fn is_empty(&self) -> bool {
         self.stack.is_empty()
     }
-}
-
-/**
+}/**
  * Your SortedStack object will be instantiated and called as such:
  * let obj = SortedStack::new();
  * obj.push(val);
  * obj.pop();
  * let ret_3: i32 = obj.peek();
  * let ret_4: bool = obj.is_empty();
- */
+ */