You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
58 lines
1.5 KiB
58 lines
1.5 KiB
/*
|
|
* File: list_node.rs
|
|
* Created Time: 2023-03-05
|
|
* Author: codingonion (coderonion@gmail.com), rongyi (hiarongyi@gmail.com)
|
|
*/
|
|
|
|
use std::cell::RefCell;
|
|
use std::collections::HashMap;
|
|
use std::rc::Rc;
|
|
|
|
#[derive(Debug)]
|
|
pub struct ListNode<T> {
|
|
pub val: T,
|
|
pub next: Option<Rc<RefCell<ListNode<T>>>>,
|
|
}
|
|
|
|
impl<T> ListNode<T> {
|
|
pub fn new(val: T) -> Rc<RefCell<ListNode<T>>> {
|
|
Rc::new(RefCell::new(ListNode { val, next: None }))
|
|
}
|
|
|
|
/* 將陣列反序列化為鏈結串列 */
|
|
pub fn arr_to_linked_list(array: &[T]) -> Option<Rc<RefCell<ListNode<T>>>>
|
|
where
|
|
T: Copy + Clone,
|
|
{
|
|
let mut head = None;
|
|
// insert in reverse order
|
|
for item in array.iter().rev() {
|
|
let node = Rc::new(RefCell::new(ListNode {
|
|
val: *item,
|
|
next: head.clone(),
|
|
}));
|
|
head = Some(node);
|
|
}
|
|
head
|
|
}
|
|
|
|
/* 將鏈結串列轉化為雜湊表 */
|
|
pub fn linked_list_to_hashmap(
|
|
linked_list: Option<Rc<RefCell<ListNode<T>>>>,
|
|
) -> HashMap<T, Rc<RefCell<ListNode<T>>>>
|
|
where
|
|
T: std::hash::Hash + Eq + Copy + Clone,
|
|
{
|
|
let mut hashmap = HashMap::new();
|
|
if let Some(node) = linked_list {
|
|
let mut current = Some(node.clone());
|
|
while let Some(cur) = current {
|
|
let borrow = cur.borrow();
|
|
hashmap.insert(borrow.val.clone(), cur.clone());
|
|
current = borrow.next.clone();
|
|
}
|
|
}
|
|
hashmap
|
|
}
|
|
}
|