数据结构 - 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. javascript - js删除页面节点有何作用,直接删除具体代码不是一样的效果么?2. debian - docker依赖的aufs-tools源码哪里可以找到啊?3. 如何在指定的JSON数据中根据指定条件拿到匹配到的结果?4. java enum 变量不能再case里面重复定义?5. 13寸笔记本win10 界面字体有点小6. mac连接阿里云docker集群,已经卡了2天了,求问?7. mysql - SELECT 多個資料表及多個欄位8. javascript - 如何为大量的sprite添加碰撞检测框?9. javascript - 获取标签中的字符串10. mysql - 执行大量SQL进行批量插入或更新,开启事务执行会提高执行速度还是降低执行速度?

网公网安备