@ -1,12 +1,12 @@
/*
* File : list_node . rs
* Created Time : 2023 - 03 - 05
* Author : codingonion ( coderonion @ gmail . com )
* Author : codingonion ( coderonion @ gmail . com ) , rongyi ( hiarongyi @ gmail . com )
* /
use std ::rc ::Rc ;
use std ::cell ::RefCell ;
use std ::collections ::HashMap ;
use std ::rc ::Rc ;
#[ derive(Debug) ]
pub struct ListNode < T > {
@ -16,25 +16,21 @@ pub struct ListNode<T> {
impl < T > ListNode < T > {
pub fn new ( val : T ) -> Rc < RefCell < ListNode < T > > > {
Rc ::new ( RefCell ::new ( ListNode {
val ,
next : None ,
} ) )
Rc ::new ( RefCell ::new ( ListNode { val , next : None } ) )
}
/* Generate a linked list with an array */
pub fn arr_to_linked_list ( array : & [ T ] ) -> Option < Rc < RefCell < ListNode < T > > > >
pub fn arr_to_linked_list ( array : & [ T ] ) -> Option < Rc < RefCell < ListNode < T > > > >
where
T : Copy + Clone ,
{
let mut head = None ;
let mut prev = None ;
// insert in reverse order
for item in array . iter ( ) . rev ( ) {
let node = Rc ::new ( RefCell ::new ( ListNode {
val : * item ,
next : prev. tak e( ) ,
next : head. clon e( ) ,
} ) ) ;
prev = Some ( node . clone ( ) ) ;
head = Some ( node ) ;
}
head
@ -43,9 +39,9 @@ impl<T> ListNode<T> {
/* Generate a hashmap with a linked_list */
pub fn linked_list_to_hashmap (
linked_list : Option < Rc < RefCell < ListNode < T > > > > ,
) -> HashMap < T , Rc < RefCell < ListNode < T > > > >
) -> HashMap < T , Rc < RefCell < ListNode < T > > > >
where
T : std ::hash ::Hash + Eq + Copy + Clone
T : std ::hash ::Hash + Eq + Copy + Clone ,
{
let mut hashmap = HashMap ::new ( ) ;
if let Some ( node ) = linked_list {