删除链表的最后一个节点 [英] Delete Last Node of a Linked List
本文介绍了删除链表的最后一个节点的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
我正在练习使用链表节点,但遇到了一个我不知道如何回答的问题.你如何删除链表中的最后一个节点.下面的代码适用于最后一个节点的所有条目栏.最后一个不会被删除.
I am practicing working with Linked List Nodes and have come upon a problem I don't know how to answer. How do you go about deleting the last node in a linked list. The code below works for all entry's bar the last node. The last does not get deleted.
节点类
public class Node {
private String data;
private Node next;
Node(String data, Node next)
{
this.data = data;
this.next = next;
}
public void setData(String d)
{
data = d;
}
public void setNext(Node n)
{
next = n;
}
public String getData()
{
return data;
}
public Node getNext()
{
return next;
}
主要
Node list = new Node("NODE 1",new Node("NODE 2",new Node("NODE 3", null)));
list = insertSecond(list,"New Node");
list = addLast(list,"LAST NODE");
printList(list);
System.out.println();
deleteNode(list,"LAST NODE");
printList(list);
}
public static Node deleteNode(Node list,String str)
{
Node temp = list;
Node prev = list;
while(temp.getNext() != null)
{
if(temp.getData().equals(str))
{
if(prev.getNext() == null)
prev.setNext(null);
else{
prev.setNext(prev.getNext().getNext());
}
}
prev = temp;
temp = temp.getNext();
}
推荐答案
我猜 while(temp.getNext() != null)
对您的最后一个元素失败.最后一个元素不会有 next
元素.所以最后一个元素不会与传递的字符串进行比较.您应该使用调试器来跟踪这一点.
I would guess while(temp.getNext() != null)
fails for your last element. The last element won't have a next
element. So the last element is not compared against the passed string. You should trace this with the debugger.
这篇关于删除链表的最后一个节点的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文