pofk_algorithm 0.0.3

A collection of efficient algorithms implemented in Rust for real-world projects.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

//! Palindrome Linked List Check (Generic, Production-Grade)
//!
//! Checks if a singly linked list is a palindrome.
//!
//! # Type Parameters
//! * `T`: Value type. Must implement `Clone` + `Eq`.
//!
//! # Example
//! ```rust
//! use pofk_algorithm::linked_list_algorithms::palindrome::*;
//! use pofk_algorithm::linked_list_algorithms::singly_linked_list::ListNode;
//! let mut head = Some(Box::new(ListNode::new(1)));
//! head.as_mut().unwrap().next = Some(Box::new(ListNode::new(2)));
//! head.as_mut().unwrap().next.as_mut().unwrap().next = Some(Box::new(ListNode::new(1)));
//! assert!(is_palindrome(&head));
//! ```
use crate::linked_list_algorithms::singly_linked_list::ListNode;

pub fn is_palindrome<T: Clone + Eq>(head: &Option<Box<ListNode<T>>>) -> bool {
    let mut vals = Vec::new();
    let mut node = head.as_ref();
    while let Some(n) = node {
        vals.push(n.val.clone());
        node = n.next.as_ref();
    }
    let n = vals.len();
    for i in 0..n/2 {
        if vals[i] != vals[n-1-i] {
            return false;
        }
    }
    true
}