摘要:
Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After re... 阅读全文
posted @ 2014-10-21 02:06
Phoebe815
阅读(150)
评论(0)
推荐(0)
摘要:
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.Solution:... 阅读全文
posted @ 2014-10-21 01:43
Phoebe815
阅读(129)
评论(0)
推荐(0)
摘要:
Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, return1->2.Given1->1->2->3->3, retu... 阅读全文
posted @ 2014-10-21 01:32
Phoebe815
阅读(117)
评论(0)
推荐(0)
摘要:
Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文
posted @ 2014-10-21 01:13
Phoebe815
阅读(102)
评论(0)
推荐(0)

浙公网安备 33010602011771号