摘要: https://leetcode.com/problems/reverse-linked-list/ 思路很简单,分别设置三个结点,之后依次调整结点1和结点2的指向关系。 Before: pre -> nxt -> nxtnxt -> ..... Here current = pre,nxt = p 阅读全文
posted @ 2015-09-14 17:06 Berne 阅读(193) 评论(0) 推荐(0) 编辑