摘要：
Given a list, rotate the list to the right by k places, where k is non-negative. For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3- 阅读全文
摘要：
Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After rem 阅读全文
摘要：
Given a linked list, swap every two adjacent（相邻的） nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Y 阅读全文