public void ReverseLink(){
if (head.next == null) {
return;
}
LinkHeadNode temp = head;
Stack<LinkHeadNode> stack = new Stack<LinkHeadNode>();
while (temp != null){
stack.push(temp);
temp = temp.next;
}
if (!stack.isEmpty()) {
head = stack.pop();
}
//方式1
// LinkHeadNode cur = head;
while (!stack.isEmpty()){
LinkHeadNode node = stack.pop();
node.next = null;
if (node == null) {
break;
}
// cur.next = node;
// cur = node;
add(node);//方式2,调用了自己写的方法
}
// return head;
}
Java栈实现单链表反转
最新推荐文章于 2023-09-27 18:01:02 发布