palindrome-linked-list.rs

#![allow(dead_code, unused, unused_variables)]

fnmain(){}

structSolution;

// Definition for singly-linked list.
#[derive(PartialEq,Eq,Clone,Debug)]
pubstructListNode{
pubval:i32,
pubnext:Option<Box<ListNode>>,
}

implListNode{
#[inline]
fnnew(val:i32) -> Self{
ListNode{next:None, val }
}
}

implSolution{
pubfnis_palindrome(head:Option<Box<ListNode>>) -> bool{
letmut v = vec![];
letmut head = head;

while head.is_some(){
 v.push(head.as_ref().unwrap().val);
 head = head.as_mut().unwrap().next.take();
}

let(mut star,mut end) = (0, v.len() - 1);
while star < end {
if v[star] != v[end]{
returnfalse;
}
 star += 1;
 end -= 1;
}

true
}
}