# LeetCode Linked List Cycle II

LeetCode Linked List Cycle II Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up: Can you solve it without using extra space? 本题在LeetCode Linked List... Read More

LeetCode Linked List Cycle Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra... Read More

LeetCode Palindrome Linked List 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? 本题要判断一个单向链表是否为回文链表。之前LeetCode Valid... Read More

# LeetCode Partition List

LeetCode Partition List Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of the two partitions. For... Read More

# LeetCode Delete Node in a Linked List

LeetCode Delete Node in a Linked List 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, the... Read More

# LeetCode Remove Linked List Elements

LeetCode Remove Linked List Elements Remove 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 -->... Read More

# LeetCode Reverse Linked List II

LeetCode Reverse Linked List II Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Note: Given m, n satisfy the... Read More