public Node reverseLink(Node head) {
if (null == head) {
return head;
}
Node next = null;
Node pre = null;
while (head != null) {
next = head.next;
head.next = pre;
pre = head;
head = next;
}
return pre;
}
单链表逆置
最新推荐文章于 2021-01-08 18:09:16 发布