摘要：
1 """ 2 Given a linked list, remove the n-th node from the end of list and return its head. 3 Example: 4 Given linked list: 1->2->3->4->5, and n = 2. 阅读全文
摘要：
1 """ 2 Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 阅读全文
摘要：
1 """ 2 Given a sorted linked list, delete all duplicates such that each element appear only once. 3 Example 1: 4 Input: 1->1->2 5 Output: 1->2 6 Exam 阅读全文
摘要：
1 """ 2 Given a linked list, swap every two adjacent nodes and return its head. 3 You may not modify the values in the list's nodes, only nodes itself 阅读全文
摘要：
1 """ 2 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their node 阅读全文