2013年6月15日
Swap Nodes in Pairs
摘要： Q:　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 algorithm should use only constant space. You maynotmodify the values in the list, only nodes itself can be changed. ListNode *swapPai 阅读全文
posted @ 2013-06-15 21:06 summer_zhou 阅读(144) 评论(0) 推荐(0)