abc_begin

摘要： 92. Reverse Linked List II【Medium】 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,  阅读全文

摘要： 206. Reverse Linked List【easy】 Reverse a singly linked list. Hint: A linked list can be reversed either iteratively or recursively. Could you implemen 阅读全文

摘要： 203. Remove Linked List Elements【easy】 Remove all elements from a linked list of integers that have value val. ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 阅读全文

摘要： 82. Remove Duplicates from Sorted List II【Medium】 Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numb 阅读全文

摘要： 83. Remove Duplicates from Sorted List【easy】 Given a sorted linked list, delete all duplicates such that each element appear only once. For example,Gi 阅读全文

摘要： 21. Merge Two Sorted Lists【easy】 Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes 阅读全文

摘要： 142. Linked List Cycle II【easy】 Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify th 阅读全文

摘要： 141. Linked List Cycle【easy】 Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space? 解法一： 经典的快慢指 阅读全文

摘要： 237. Delete Node in a Linked List【easy】 Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. S 阅读全文

摘要： 234. Palindrome Linked List【easy】 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? 阅读全文