Problem: Implement a function to check if a singly linked list is a palindrome. 思路: 最简单的方法是 Reverse and compare. 另外一种非常经典的办法是用 Recursive 的思路,把一个list看成这种形式: 0 ( 1 ( 2 ( 3 ) 2 ) 1 ) 0 0 ( 1 ( 2 ( 3 3 ) 2
Check if a given string is a valid palindrome but ignore characters other than Uppercase, Lowercase and Digits (alphanumeric). The comparison is case-insensitive. The empty string is defined as a valid palindrome. First step, it is easy to check if any character is one of the alphanumeric...