fmt file

Author: bestgopher

src/bin/3sum-closest.rs

@@ -14,7 +14,11 @@ impl Solution {
                     if s == target {
                         return s;
                     }
-                    sum = if (sum - target).abs() > (s - target).abs() { s } else { sum };
+                    sum = if (sum - target).abs() > (s - target).abs() {
+                        s
+                    } else {
+                        sum
+                    };
                 }
             }
         }
@@ -46,7 +50,11 @@ impl Solution {
                     left += 1;
                 }
 
-                sum = if (s - target).abs() > (sum - target).abs() { sum } else { s };
+                sum = if (s - target).abs() > (sum - target).abs() {
+                    sum
+                } else {
+                    s
+                };
             }
         }
 

src/bin/4sum.rs

@@ -2,7 +2,10 @@ fn main() {
     // println!("{:?}", Solution::four_sum(vec![1, 0, -1, 0, -2, 2], 0));
     // println!("{:?}", Solution::four_sum(vec![0, 0, 0, 0], 0));
     // println!("{:?}", Solution::four_sum(vec![-2, -1, -1, 1, 1, 2, 2], 0));
-    println!("{:?}", Solution::four_sum(vec![1, -2, -5, -4, -3, 3, 3, 5], -11));
+    println!(
+        "{:?}",
+        Solution::four_sum(vec![1, -2, -5, -4, -3, 3, 3, 5], -11)
+    );
 }
 
 struct Solution;

src/bin/add-binary.rs

@@ -25,7 +25,6 @@ impl Solution {
                 b'0'
             };
 
-
             m = Self::add(a1, b1, m.1);
             let l = s.len() - index - 1;
             s[l] = m.0;
@@ -37,7 +36,10 @@ impl Solution {
             s[l] = b'1';
         }
 
-        String::from_utf8(s).unwrap().trim_start_matches('0').to_string()
+        String::from_utf8(s)
+            .unwrap()
+            .trim_start_matches('0')
+            .to_string()
     }
 
     /// 返回a+b的和与进制

src/bin/add-two-numbers.rs

@@ -12,21 +12,24 @@ pub struct ListNode {
 impl ListNode {
     #[inline]
     fn new(val: i32) -> Self {
-        ListNode {
-            next: None,
-            val,
-        }
+        ListNode { next: None, val }
     }
 }
 
 impl Solution {
-    pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+    pub fn add_two_numbers(
+        l1: Option<Box<ListNode>>,
+        l2: Option<Box<ListNode>>,
+    ) -> Option<Box<ListNode>> {
         Self::re(l1, l2, 0)
     }
 
-
     /// base: 进制，相加和大于10进制
-    fn re(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>, base: i32) -> Option<Box<ListNode>> {
+    fn re(
+        l1: Option<Box<ListNode>>,
+        l2: Option<Box<ListNode>>,
+        base: i32,
+    ) -> Option<Box<ListNode>> {
         if l1.is_none() && l2.is_none() {
             if base == 0 {
                 return None;

src/bin/balanced-binary-tree.rs

@@ -21,8 +21,8 @@ impl TreeNode {
     }
 }
 
-use std::rc::Rc;
 use std::cell::RefCell;
+use std::rc::Rc;
 
 impl Solution {
     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {

src/bin/binary-search-tree-iterator.rs

@@ -21,8 +21,8 @@ impl TreeNode {
     }
 }
 
-use std::rc::Rc;
 use std::cell::RefCell;
+use std::rc::Rc;
 
 /**
  * Your BSTIterator object will be instantiated and called as such:
@@ -31,10 +31,9 @@ use std::cell::RefCell;
  * let ret_2: bool = obj.has_next();
  */
 struct BSTIterator {
-    stack: Vec::<Option<Rc<RefCell<TreeNode>>>>
+    stack: Vec<Option<Rc<RefCell<TreeNode>>>>,
 }
 
-
 /**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.

src/bin/binary-tree-inorder-traversal.rs

@@ -21,8 +21,8 @@ impl TreeNode {
     }
 }
 
-use std::rc::Rc;
 use std::cell::RefCell;
+use std::rc::Rc;
 
 impl Solution {
     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {

src/bin/binary-tree-level-order-traversal-ii.rs

@@ -21,8 +21,8 @@ impl TreeNode {
     }
 }
 
-use std::rc::Rc;
 use std::cell::RefCell;
+use std::rc::Rc;
 
 impl Solution {
     pub fn level_order_bottom(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
@@ -36,7 +36,6 @@ impl Solution {
     fn f(nodes: Vec<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
         let mut result = vec![];
 
-
         if nodes.len() == 0 {
             return result;
         }

src/bin/binary-tree-level-order-traversal.rs

@@ -21,8 +21,8 @@ impl TreeNode {
     }
 }
 
-use std::rc::Rc;
 use std::cell::RefCell;
+use std::rc::Rc;
 
 impl Solution {
     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {

src/bin/binary-tree-postorder-traversal.rs

@@ -21,8 +21,8 @@ impl TreeNode {
     }
 }
 
-use std::rc::Rc;
 use std::cell::RefCell;
+use std::rc::Rc;
 
 impl Solution {
     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {