init

Signed-off-by: alei <[email protected]>

Author: aylei

.gitignore

@@ -0,0 +1 @@
+target/

Cargo.lock

@@ -0,0 +1,6 @@
+[package]
+name = "leetcode-rust"
+version = "0.1.0"
+authors = ["alei <[email protected]>"]
+edition = "2019"
+

Cargo.toml

@@ -0,0 +1,13 @@
+# My Leetcode Solution in Rust
+
+Each `.rs` file consists of three parts:
+
+* problem description
+* my solution
+* test cases
+
+Run `cargo test test_{id}` to test the solution for problem #id.
+
+Working in progress, solutions list:
+
+* [1 - two sum](./src/two_sum_1.rs)

README.md

@@ -0,0 +1,5 @@
+// make cargo happy
+pub mod two_sum_1;
+
+fn main() {
+}

src/main.rs

@@ -0,0 +1,47 @@
+/*
+ * [1] Two Sum
+ *
+ * https://leetcode.com/problems/two-sum/description/
+ *
+ * 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 {}
+
+use std::collections::HashMap;
+impl Solution {
+    pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
+        let mut map = HashMap::with_capacity(nums.len());
+        for (index, num) in nums.iter().enumerate() {
+            match map.get(&(target - num)) {
+                None => { map.insert(num, index); },
+                Some(sub_index) => { return vec![*sub_index as i32, index as i32] },
+            }
+        }
+        vec![]
+    }
+}
+
+#[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));
+    }
+}