cargo clippy project

Author: bestgopher

README.md

@@ -9,7 +9,7 @@ use crate::http::Resp;
 pub fn all() {
     let files = file::get_all_bin_file();
 
-    let mut v = Vec::<Resp>::with_capacity(files.len());
+    let v = Vec::<Resp>::with_capacity(files.len());
 
     let x = Arc::new(Mutex::new(v));
     let mut handlers = vec![];
@@ -26,14 +26,15 @@ pub fn all() {
 
         handlers.push(thread::spawn(move || {
             for i in files {
+                println!("{} downloading", i);
                 let resp = crate::http::get_question_info(&i);
                 x.lock().unwrap().push(resp);
             }
         }))
     }
 
     for i in handlers {
-        i.join();
+        i.join().unwrap();
     }
 
     crate::file::write_readme(&mut *x.lock().unwrap());

src/all.rs

@@ -44,7 +44,7 @@ impl Solution {
         count
     }
 
-    pub fn num_rescue_boats(mut people: Vec<i32>, limit: i32) -> i32 {
+    pub fn num_rescue_boats(people: Vec<i32>, limit: i32) -> i32 {
         let mut v = vec![0; (limit + 1) as usize];
 
         for i in people {

src/bin/boats-to-save-people.rs

@@ -1,4 +1,4 @@
-use std::ptr::hash;
+
 
 fn main() {}
 
@@ -12,7 +12,7 @@ impl Solution {
 
         let (mut a, mut b) = (1, 2);
 
-        for i in 3..=n {
+        for _i in 3..=n {
             let a1 = a;
             a = b;
             b = a1 + b;

src/bin/climbing-stairs.rs

@@ -22,7 +22,7 @@ impl Solution {
                 v.push(i);
                 r.push(v);
             } else if i < target {
-                let mut x = Self::calc(&candidates, target - i);
+                let x = Self::calc(&candidates, target - i);
                 for mut m in x {
                     if !m.is_empty() {
                         if i >= *m.last().unwrap() {

src/bin/combination-sum.rs

@@ -23,7 +23,7 @@ impl TreeNode {
 }
 
 use std::cell::RefCell;
-use std::ops::Deref;
+
 use std::rc::Rc;
 
 struct Solution;

src/bin/construct-binary-search-tree-from-preorder-traversal.rs

@@ -21,9 +21,9 @@ impl TreeNode {
     }
 }
 
-use std::arch::x86_64::_mm_xor_pd;
+
 use std::cell::RefCell;
-use std::cmp::{max, min};
+
 use std::rc::Rc;
 
 impl Solution {
@@ -70,7 +70,7 @@ impl Solution {
         }
 
         while max_count - min_count > 1 {
-            let mut middle = (min_count + max_count) / 2;
+            let middle = (min_count + max_count) / 2;
 
             let e = exists(root.as_ref(), middle, level);
             if e {

src/bin/count-complete-tree-nodes.rs

@@ -8,7 +8,7 @@ impl Solution {
             return n;
         }
         let (mut last, mut result) = (1, 1);
-        for i in 2..n {
+        for _i in 2..n {
             let result1 = result + last;
             last = result;
             result = result1 % 1000000007;

src/bin/fei-bo-na-qi-shu-lie-lcof.rs

@@ -27,7 +27,7 @@ impl Solution {
         }
 
         let index = Self::split(&arr, x);
-        let (mut start, mut end, mut k) = (index, index, k as usize);
+        let (mut start, mut end, k) = (index, index, k as usize);
         while end - start < k - 1 {
             if start == 0 {
                 end += 1;

src/bin/find-k-closest-elements.rs

@@ -16,7 +16,7 @@ impl Solution {
                 .or_insert(vec![i]);
         }
 
-        hash.into_iter().map(|(x, y)| y).collect()
+        hash.into_iter().map(|(_x, y)| y).collect()
     }
 
     // 计算字母出现的个数
@@ -37,6 +37,6 @@ impl Solution {
             }
         }
 
-        hash.into_iter().map(|(x, y)| y).collect()
+        hash.into_iter().map(|(_x, y)| y).collect()
     }
 }