摘要: Problem: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, m = 2 and n = 4,return 1->4... 阅读全文
posted @ 2015-06-24 11:16 尾巴草 阅读(153) 评论(0) 推荐(0) 编辑