solve #1

Author: HunDunDM

Diff for: README.md

@@ -4,11 +4,19 @@
 
 项目结构以及template参考了[aylei](https://github.com/aylei)的[leetcode-rust](https://github.com/aylei/leetcode-rust)项目，感谢大佬
 
-# 其他环境
+# 环境
 
 * System: macOS
 * IDE：PyCharm(with Rust Plugin)
 * Python: 3.7
 
+# 使用
+
+* PyCharm会自动建立该项目的Python venv环境
+* `pip install -r requirements.txt` 安装所需的py组件
+* `python new.py {id}` 生成对应题目的模板
+* `cargo test test_{id}` 运行测试样例
+
 # 目录
 
+* [1 - Two Sum](./src/p0001_two_sum.rs)

Diff for: new.py

@@ -106,7 +106,7 @@ def new_code_file(pid, problem):
     assert len(rust_code) == 1, f'problem #{pid} has no rust support yet'
     rust_code = rust_code[0]['defaultCode']
     # 判断文件是否已经存在
-    file_name = 'p{:04d}_{}'.format(pid, problem.title_slug)
+    file_name = 'p{:04d}_{}'.format(pid, problem.title_slug).replace('-', '_')
     file_path = f'./src/{file_name}.rs'
     assert not os.path.exists(file_path), f'problem #{pid} already initialized'
     # 按模板生成代码

Diff for: src/lib.rs

@@ -1,3 +1,4 @@
 #[macro_use]
 pub mod utils;
 
+mod p0001_two_sum;

Diff for: src/main.rs

@@ -1,3 +1,2 @@
 fn main() {
-    println!("Hello, world!");
 }

Diff for: src/p0001_two_sum.rs

@@ -0,0 +1,46 @@
+/**
+ * [1] Two Sum
+ *
+ * Given an array of integers, return indices of the two numbers such that they add up to a specific target.
+ * You may assume that each input would have exactly one solution, and you may not use the same element twice.
+ * Example:
+ * 
+ * Given nums = [2, 7, 11, 15], target = 9,
+ * 
+ * Because nums[0] + nums[1] = 2 + 7 = 9,
+ * return [0, 1].
+ *  
+ * 
+ */
+
+pub struct Solution {}
+
+// submission codes start here
+
+use std::collections::HashMap;
+impl Solution {
+    pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
+        let mut m = HashMap::new();
+        for (i, x) in nums.iter().enumerate() {
+            if m.get(&(target  - x)) == None {
+                m.insert(x, i);
+            } else {
+                return vec![*m.get(&(target  - x)).unwrap() as i32, i as i32];
+            }
+        }
+        return vec![-1, -1];
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_1() {
+        assert_eq!(vec![0, 1], Solution::two_sum(vec![2, 7, 11, 15], 9));
+        assert_eq!(vec![1, 2], Solution::two_sum(vec![3, 2, 4], 6));
+    }
+}

Diff for: template.rs

@@ -3,6 +3,7 @@
  *
  * __PROBLEM_DESC__
  */
+
 pub struct Solution {}__EXTRA_USE__
 
 // submission codes start here