chore: format rust code with rustfmt (#3140)

Author: yanglbme

basic/sorting/HeapSort/README.md

@@ -480,19 +480,13 @@ 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/MergeSort/README.md

@@ -302,10 +302,7 @@ 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() {

lcci/01.03.String to URL/README.md

@@ -181,7 +181,11 @@ 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

@@ -195,7 +195,11 @@ 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/02.05.Sum Lists/README.md

@@ -220,7 +220,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

@@ -224,7 +224,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/03.02.Min Stack/README.md

@@ -250,7 +250,10 @@ struct MinStack {
 impl MinStack {
     /** initialize your data structure here. */
     fn new() -> Self {
-        Self { stack: VecDeque::new(), min_stack: VecDeque::new() }
+        Self {
+            stack: VecDeque::new(),
+            min_stack: VecDeque::new(),
+        }
     }
 
     fn push(&mut self, x: i32) {

lcci/03.02.Min Stack/README_EN.md

@@ -270,7 +270,10 @@ struct MinStack {
 impl MinStack {
     /** initialize your data structure here. */
     fn new() -> Self {
-        Self { stack: VecDeque::new(), min_stack: VecDeque::new() }
+        Self {
+            stack: VecDeque::new(),
+            min_stack: VecDeque::new(),
+        }
     }
 
     fn push(&mut self, x: i32) {

lcci/03.05.Sort of Stacks/README.md

@@ -323,7 +323,11 @@ impl SortedStack {
     }
 
     fn peek(&self) -> i32 {
-        if self.is_empty() { -1 } else { *self.stk.back().unwrap() }
+        if self.is_empty() {
+            -1
+        } else {
+            *self.stk.back().unwrap()
+        }
     }
 
     fn is_empty(&self) -> bool {

lcci/03.05.Sort of Stacks/README_EN.md

@@ -337,7 +337,11 @@ impl SortedStack {
     }
 
     fn peek(&self) -> i32 {
-        if self.is_empty() { -1 } else { *self.stk.back().unwrap() }
+        if self.is_empty() {
+            -1
+        } else {
+            *self.stk.back().unwrap()
+        }
     }
 
     fn is_empty(&self) -> bool {