01-08-2020

Author: safrannn

Cargo.lock

@@ -5,4 +5,5 @@ authors = ["chengsu"]
 edition = "2018"
 
 [dependencies]
-leetcode_prelude = "0.2"
+leetcode_prelude = "0.2"
+util = "0.1.2"

Cargo.toml

@@ -0,0 +1,21 @@
+struct Solution;
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
+        let mut number_map = HashMap::with_capacity(nums.len());
+        for (idx, num) in nums.into_iter().enumerate() {
+            if number_map.contains_key(&num) {
+                return vec![number_map[&num] as i32, idx as i32];
+            } else {
+                number_map.insert(target - num, idx);
+            }
+        }
+        vec![]
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(Solution::two_sum(vec![2, 7, 11, 15], 9), vec![0, 1]);
+}

src/_0001_two_sum.rs

@@ -0,0 +1,30 @@
+struct Solution;
+use crate::util::*;
+
+impl Solution {
+    fn merge_two_lists(l1: ListLink, l2: ListLink) -> ListLink {
+        if l1.is_none() {
+            return l2;
+        }
+        if l2.is_none() {
+            return l1;
+        }
+        let mut p1 = l1.unwrap();
+        let mut p2 = l2.unwrap();
+        if p1.val < p2.val {
+            p1.next = Self::merge_two_lists(p1.next, Some(p2));
+            Some(p1)
+        } else {
+            p2.next = Self::merge_two_lists(Some(p1), p2.next);
+            Some(p2)
+        }
+    }
+}
+
+#[test]
+fn test() {
+    let a = ListNode::list(vec![1, 2, 4]);
+    let b = ListNode::list(vec![1, 3, 4]);
+    let c = ListNode::list(vec![1, 1, 2, 3, 4, 4]);
+    assert_eq!(Solution::merge_two_lists(a, b), c);
+}

src/_0021_merge_two_sorted_lists.rs

@@ -5,9 +5,16 @@
 #![allow(clippy::needless_range_loop)]
 #![allow(clippy::float_cmp)]
 #![allow(clippy::cast_lossless)]
+
+//
+mod util;
+//
+mod _0001_two_sum;
 //
 mod _0020_valid_parentheses;
 //
+mod _0021_merge_two_sorted_lists;
+//
 mod _0202_happy_number;
 //
 mod _1281_subtract_the_product_and_sum_of_digits_of_an_integer;

src/lib.rs

@@ -0,0 +1,23 @@
+#[derive(PartialEq, Eq, Clone, Debug)]
+pub struct ListNode {
+    pub val: i32,
+    pub next: ListLink,
+}
+
+pub type ListLink = Option<Box<ListNode>>;
+
+impl ListNode {
+    pub fn list(v: Vec<i32>) -> ListLink {
+        let mut next: ListLink = None;
+        for &val in v.iter().rev() {
+            next = Some(Box::new(ListNode { val, next }))
+        }
+        next
+    }
+}
+
+impl ListNode {
+    pub fn node(val: i32, next: ListLink) -> ListLink {
+        Some(Box::new(ListNode { val, next }))
+    }
+}