数据结构 - java翻转链表是如何实现的?
问题描述
public class Node { public int value; public Node next; public Node(int data) {this.value = data; } public Node reverse(Node head) {Node pre = null;Node next = null;while (head != null) { next = head.next; head.next = pre; pre = head; head = next;}return pre; }
这段代码while循环中他是如何翻转的?想要详细一点的,debug了几次还是没弄懂具体是怎么回事
问题解答
回答1:参考一下,理解目的就比较好理解了。容易混乱的地方就是从右往左来处理,因为得先把后面的东西存起来,不然被覆盖掉就丢了。
prehead +----+ +----+ +> +----+| | | | | | || | | | | | || | | | | | |+----+ +----+ | +----+| | | | | | || | | | | | |+----+ +-+--+ | +----+ | | +-----+ prehead nextnext = head.next;+----+ +----+ +> +----+| | | | | | || | | | | | || | | | | | |+----+ +----+ | +----+| | | | | | || | | | | | |+----+ +-+--+ | +----+ | | +-----+ prehead next+----+ <+ +----+ +----+| | | | | | || | | | | | || | | | | | |+----+ | +----+ +----+| | | | | | || | | | | | |+----+ | +-+--+ +----+| | head.next = pre;+----+ next preheadpre = head;+----+ <+ +----+ +----+ head = next;| | | | | | || | | | | | || | | | | | |+----+ | +----+ +----+| | | | | | || | | | | | |+----+ | +-+--+ +----+| |+----+回答2:




Ps:建议先多了解一下链表
相关文章:
1. css3 - 微信前端页面遇到的transition过渡动画的bug2. css - 文字排版问题,内容都是动态抓出来的,字数不一定。如何对齐啊3. 网页爬虫 - 关于Python的编码与解码问题4. css3 - 微信小程序如何把radio改成2个选择按钮的样式5. javascript - 为什么var obj = {}创建对象的方法里面不能用this.xxx来声明属性 ?6. javascript - Storage中removeItem在什么情况下使用7. javascript - router.push无效8. selenium-selenium-webdriver - python 将当前目录加入到 环境变量9. css - input间的间距和文字上下居中10. javascript - 浏览器回退,如何保证js对dom的操作保存下来

网公网安备