Merge pull request #3 from bestgopher/feature/new-script

Feature/new script

Author: bestgopher

Cargo.toml

@@ -11,7 +11,12 @@ git2 = "0.13.15"
 reqwest = { version = "0.10", features = ["blocking", "json"] }
 serde_json = "1.0"
 serde = { version = "1.0", features = ["derive"] }
+clap = "3.0.0-beta.2"
+tera = "1.12.1"
+lazy_static = "1.4.0"
+regex = "1"
+
 
 [[bin]]
 name ="leetcode"
-path ="src/main.rs"
+path = "src/main.rs"

README.md

@@ -0,0 +1,41 @@
+use crate::file;
+
+use std::sync::{Arc, Mutex};
+use std::thread;
+use crate::http::Resp;
+
+
+/// 重新格式化
+pub fn all() {
+    let files = file::get_all_bin_file();
+
+    let v = Vec::<Resp>::with_capacity(files.len());
+
+    let x = Arc::new(Mutex::new(v));
+    let mut handlers = vec![];
+
+    for i in 0..=files.len() / 10 {
+        // 把files分块，分成10个文件一块
+        let files = if i * 10 + 10 > files.len() {
+            files[i * 10..files.len()].to_vec()
+        } else {
+            files[i * 10..i * 10 + 10].to_vec()
+        };
+
+        let x = x.clone();
+
+        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().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;