Merge pull request #351 from caitlingao/feat-rust-07-linkedlist

feat(geektime_algo): add 07 linkedlists algo

Author: wangzheng0822

rust/07_linkedlist/linked_list_cycle.rs

@@ -0,0 +1,18 @@
+use super::util::linked_list::{ListNode, to_list};
+
+pub fn has_cycle(head: Option<Box<ListNode>>) -> bool {
+    let mut fast_p = &head;
+    let mut slow_p = &head;
+
+    while fast_p.is_some() && fast_p.as_ref().unwrap().next.is_some() {
+        slow_p = &slow_p.as_ref().unwrap().next;
+        fast_p = &fast_p.as_ref().unwrap().next.as_ref().unwrap().next;
+
+        if slow_p == fast_p { return true; }
+    }
+    false
+}
+
+fn main() {
+    println!("{:?}", has_cycle(to_list(vec![1, 2, 3, 4, 5])));
+}

rust/07_linkedlist/merge_two_sorted_lists.rs

@@ -0,0 +1,24 @@
+use super::util::linked_list::{ListNode, to_list};
+
+pub fn merge_two_lists(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+    match (l1, l2) {
+        (Some(node1), None) => Some(node1),
+        (None, Some(node2)) => Some(node2),
+        (Some(mut node1), Some(mut node2)) => {
+            if node1.val < node2.val {
+                let n = node1.next.take();
+                node1.next = Solution::merge_two_lists(n, Some(node2));
+                Some(node1)
+            } else {
+                let n = node2.next.take();
+                node2.next = Solution::merge_two_lists(Some(node1), n);
+                Some(node2)
+            }
+        },
+        _ => None,
+    }
+}
+
+fn main() {
+    println!("{:?}", merge_two_lists(to_list(vec![1, 3, 4]), to_list(vec![1, 2, 4])));
+}

rust/07_linkedlist/middle_of_the_linked_list.rs

@@ -0,0 +1,16 @@
+use super::util::linked_list::{ListNode, to_list};
+
+pub fn middle_node(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+    let mut fast_p = &head;
+    let mut slow_p = &head;
+
+    while fast_p.is_some() && fast_p.as_ref().unwrap().next.is_some() {
+        slow_p = &slow_p.as_ref().unwrap().next;
+        fast_p = &fast_p.as_ref().unwrap().next.as_ref().unwrap().next;
+    }
+    slow_p.clone()
+}
+
+fn main() {
+    println!("{:?}", middle_node(to_list(vec![1, 3, 4])));
+}

rust/07_linkedlist/remove_nth_node_from_end_of_list.rs

@@ -0,0 +1,28 @@
+use super::util::linked_list::{ListNode, to_list};
+
+pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
+    let mut dummy = Some(Box::new(ListNode { val: 0, next: head }));
+    let mut cur = &mut dummy;
+    let mut length = 0;
+
+    while let Some(_node) = cur.as_mut() {
+        cur = &mut cur.as_mut().unwrap().next;
+        if let Some(_inner_node) = cur { length += 1; }
+    }
+
+    let mut new_cur = dummy.as_mut();
+    let idx = length - n;
+
+    for _ in 0..idx {
+        new_cur = new_cur.unwrap().next.as_mut();
+    }
+
+    let next = new_cur.as_mut().unwrap().next.as_mut().unwrap().next.take();
+    new_cur.as_mut().unwrap().next = next;
+
+    dummy.unwrap().next
+}
+
+fn main() {
+    println!("{:?}", remove_nth_from_end(to_list(vec![1, 3, 4])));
+}

rust/07_linkedlist/reverse_linked_list.rs

@@ -0,0 +1,20 @@
+use super::util::linked_list::{ListNode, to_list};
+
+pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+    let mut prev = None;
+    let mut curr = head;
+
+    while let Some(mut boxed_node) = curr.take() {
+        let next = boxed_node.next.take();
+        boxed_node.next = prev.take();
+
+        prev = Some(boxed_node);
+        curr = next;
+    }
+
+    prev
+}
+
+fn main() {
+    println!("{:?}", reverse_list(to_list(vec![1, 2, 3, 4, 5])));
+}

rust/07_linkedlist/util/linked_list.rs

@@ -0,0 +1,32 @@
+// Definition for singly-linked list.
+#[derive(PartialEq, Eq, Clone, Debug)]
+pub struct ListNode {
+    pub val: i32,
+    pub next: Option<Box<ListNode>>
+}
+
+impl ListNode {
+    #[inline]
+    fn new(val: i32) -> Self {
+        ListNode {
+            next: None,
+            val
+        }
+    }
+}
+
+pub fn to_list(vec: Vec<i32>) -> Option<Box<ListNode>> {
+    let mut current = None;
+    for &v in vec.iter().rev() {
+        let mut node = ListNode::new(v);
+        node.next = current;
+        current = Some(Box::new(node));
+    }
+    current
+}
+
+#[macro_export]
+macro_rules! linked {
+    ($($e:expr),*) => {to_list(vec![$($e.to_owned()), *])};
+    ($($e:expr,)*) => {to_list(vec![$($e.to_owned()), *])};
+}