HERO_CJN的博客

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, t

Given a singly linked list, determine if it is a palindrome.Follow up: Could you do it in O(n) time and O(1) space?转自： http://www.cnblogs.com/grandyang/p/4635425.html解法一： 这道题让我们判断一个链表是否为回文链表，那么根据回文串的

一、Linked List1、Remove Linked List ElementsRemove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5/