add new question rust file

bestgopher · bestgopher · commit 57435075a244 · 2021-01-05T22:35:37.000+08:00
diff --git a/Cargo.toml b/Cargo.toml
@@ -11,3 +11,7 @@ git2 = "0.13.15"
 reqwest = { version = "0.10", features = ["blocking", "json"] }
 serde_json = "1.0"
 serde = { version = "1.0", features = ["derive"] }
+
+[[bin]]
+name ="leetcode"
+path ="src/main.rs"
diff --git a/README.md b/README.md
@@ -1,79 +0,0 @@
-# leetcode
-通过rust刷leetcode题目。
-通过刷leetcode题目学习rust。
-
-当前已刷：23
-
-### 题目
-- 6：Z 字形变换
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/zigzag-conversion.rs)
-    - [leetcode](https://leetcode-cn.com/problems/zigzag-conversion/)
-- 07：传递信息
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/chuan-di-xin-xi.rs)
-    - [leetcode](https://leetcode-cn.com/problems/chuan-di-xin-xi/)
-- 09：用两个栈实现队列
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/yong-liang-ge-zhan-shi-xian-dui-lie-lcof.rs)
-    - [leetcode](https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/)
-- 43：字符串相乘
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/multiply-strings.rs)
-    - [leetcode](https://leetcode-cn.com/problems/multiply-strings/)
-- 136：只出现一次的数字
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/single-number.rs)
-    - [leetcode](https://leetcode-cn.com/problems/single-number/)
-- 137：只出现一次的数字 II
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/single-number-ii.rs)
-    - [leetcode](https://leetcode-cn.com/problems/single-number-ii/)
-- 229：求众数 II
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/majority-element-ii.rs)
-    - [leetcode](https://leetcode-cn.com/problems/majority-element-ii/)
-- 367：有效的完全平方数
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/valid-perfect-square.rs)
-    - [leetcode](https://leetcode-cn.com/problems/valid-perfect-square/)
-- 371：两整数之和
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/sum-of-two-integers.rs)
-    - [leetcode](https://leetcode-cn.com/problems/sum-of-two-integers/)
-- 374：猜数字大小
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/guess-number-higher-or-lower.rs)
-    - [leetcode](https://leetcode-cn.com/problems/guess-number-higher-or-lower/)
-- 387：字符串中的第一个唯一字符
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/first-unique-character-in-a-string.rs)
-    - [leetcode](https://leetcode-cn.com/problems/first-unique-character-in-a-string/)
-- 674：最长连续递增序列
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/longest-continuous-increasing-subsequence.rs)
-    - [leetcode](https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence/)
-- 746：检查整数及其两倍数是否存在
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/check-if-n-and-its-double-exist.rs) 
-    - [leetcode](https://leetcode-cn.com/problems/check-if-n-and-its-double-exist/)
-- 811：子域名访问计数
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/subdomain-visit-count.rs) 
-    - [leetcode](https://leetcode-cn.com/problems/subdomain-visit-count/)
-- 857：较大分组的位置
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/positions-of-large-groups.rs)
-    - [leetcode](https://leetcode-cn.com/problems/positions-of-large-groups/)
-- 965：单值二叉树
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/univalued-binary-tree.rs) 
-    - [leetcode](https://leetcode-cn.com/problems/univalued-binary-tree/)
-- 1008：前序遍历构造二叉搜索树
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/construct-binary-search-tree-from-preorder-traversal.rs)
-    - [leetcode](https://leetcode-cn.com/problems/construct-binary-search-tree-from-preorder-traversal/)
-- 1309：解码字母到整数映射
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/decrypt-string-from-alphabet-to-integer-mapping.rs)
-    - [leetcode](https://leetcode-cn.com/problems/decrypt-string-from-alphabet-to-integer-mapping/)
-- 1432：可获得的最大点数
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/maximum-points-you-can-obtain-from-cards.rs)
-    - [leetcode](https://leetcode-cn.com/problems/maximum-points-you-can-obtain-from-cards/)
-- 1480：一维数组的动态和
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/maximum-points-you-can-obtain-from-cards.rs)
-    - [leetcode](https://leetcode-cn.com/problems/running-sum-of-1d-array/)
-- 1538：可获得的最大点数
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/maximum-points-you-can-obtain-from-cards.rs)
-    - [leetcode](https://leetcode-cn.com/problems/maximum-points-you-can-obtain-from-cards/)
-- 1552：用栈操作构建数组
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/build-an-array-with-stack-operations.rs)
-    - [leetcode](https://leetcode-cn.com/problems/build-an-array-with-stack-operations/)
-- 1566：检查单词是否为句中其他单词的前缀
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.rs)
-    - [leetcode](https://leetcode-cn.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/)
--	1678：设计 Goal 解析器
-    - [src](https://github.com/rustors/leetcode/blob/main/src/bin/goal-parser-interpretation.rs)
-    - [leetcode](https://leetcode-cn.com/problems/goal-parser-interpretation/)
diff --git a/src/bin/maximum-points-you-can-obtain-from-cards.rs b/src/bin/maximum-points-you-can-obtain-from-cards.rs
@@ -10,7 +10,7 @@ impl Solution {
     /// 如果从头开始的话，区间的和为card_points[..k]的和sum1，区间向后移动一位，区间sum1 = sum1+card_points[k]-card_points[0]
     pub fn max_score(card_points: Vec<i32>, k: i32) -> i32 {
         // 剩余数组的长度
-        let other = (card_points.len() - k as usize);
+        let other = card_points.len() - k as usize;
         // 假设剩余数组从0下标开始，和为sum1
         let mut sum1: i32 = card_points[0..other].iter().sum();
         let mut sum = sum1;
diff --git a/src/lib.rs b/src/lib.rs
@@ -29,6 +29,16 @@ mod tests {
         assert_eq!(374, get_question_no("- 374：猜数字大小"));
         assert_eq!(367, get_question_no("- 367：有效的完全平方数"));
     }
+
+    #[test]
+    fn test_get_question_msg() {
+        println!("{:?}", get_question_msg("maximum-points-you-can-obtain-from-cards"));
+    }
+
+    #[test]
+    fn test_make_new_file() {
+        make_new_file(get_question_msg("shu-de-zi-jie-gou-lcof"));
+    }
 }
 
 extern crate reqwest;
@@ -66,6 +76,20 @@ pub struct Ques {
     title_slug: String,
     #[serde(rename = "translatedTitle")]
     translated_title: String,
+    #[serde(rename = "codeSnippets")]
+    code_snippets: Vec<CodeSnippets>,
+}
+
+#[derive(Deserialize, Debug)]
+pub struct CodeSnippets {
+    #[serde(rename = "code")]
+    code: String,
+    #[serde(rename = "lang")]
+    lang: String,
+    #[serde(rename = "langSlug")]
+    lang_slug: String,
+    #[serde(rename = "__typename")]
+    typename: String,
 }
 
 #[derive(Deserialize, Debug)]
@@ -190,4 +214,20 @@ fn add_and_commit(file: &str) {
 
 fn push_to_origin() {
     Command::new("git").arg("push").output().unwrap();
-}
+}
+
+/// 通过题目名获取rust答题模板
+pub fn make_new_file(resp: Resp) {
+    let mut f = File::create(format!("src/bin/{}.rs", resp.data.question.title_slug)).unwrap();
+    let mut s = String::new();
+    s.push_str("fn main() {}\n\n");
+
+    for i in resp.data.question.code_snippets {
+        if i.lang == "Rust" {
+            s.push_str(i.code.replace("↵", "\n").as_str())
+        }
+    }
+    s.push_str("\n");
+
+    f.write(s.as_bytes()).unwrap();
+}
diff --git a/src/main.rs b/src/main.rs
@@ -2,6 +2,17 @@
 use leetcode;
 
 fn main() {
+    let args = std::env::args().collect::<Vec<String>>();
+    if args.len() == 1 {
+        git();
+    } else if args.len() == 2 {
+        new(args[1].as_str());
+    } else {
+        panic!("只能有一个参数");
+    }
+}
+
+fn git() {
     // 获取新加的文件
     let files = leetcode::get_new_file_in_bin();
 
@@ -12,3 +23,8 @@ fn main() {
 
     leetcode::git_add_commit_files(files);
 }
+
+fn new(filename: &str) {
+    let resp = leetcode::get_question_msg(filename);
+    leetcode::make_new_file(resp);
+}
