Java链表实现三例绝对经典.docVIP

整理者： I have a dream QQ: 528524079 之所以所这三个是经典不是因为它在开发中重要而是说它在实现上有浅到深，通过这三个例题你绝对能感受到链表设置头结点的重要性，以及使用内部类的重要性。 一 class Node{ private String name; private Node next; public Node(String name){ this.name=name; } public void setNext(Node next){ this.next=next; } public Node getNext(){ return this.next; } public String getName(){ return this.name; } } public class Link{ public static void main(String []args){ Node root=new Node(根节点); Node n1=new Node(第一节点); Node n2=new Node(第二节点); Node n3=new Node(第三节点); root.setNext(n1); n1.setNext(n2); n2.setNext(n3); print(root); } public static void print(Node node){ if(node!=null){ System.out.print(node.getName()+-----); } if(node.getNext()!=null){ print(node.getNext()); } } } 二 class Node{ private String name; private Node nextNode; public Node(){ this.name = 表头; } public Node(String name){ this.setName(name); } public void setName(String name){ this.name = name; } public void setNextNode(Node nextNode){ this.nextNode = nextNode; } public String getName(){ return name; } public Node getNextNode(){ return nextNode; } } class LinkNode{ private static Node node; private static Node firstNode = new Node(); private static LinkNode linkNode = new LinkNode(firstNode); private LinkNode(Node node){ this.setNode(node); } public static LinkNode getLinkNode(){ return linkNode; } public void setNode(Node node){ this.node = node; } public Node getNode(){ return node; } public Node getFirstNode(){ return firstNode; } public void addNode(String name){ Node node = new Node(name); this.getNode().setNextNode(node); this.setNode(node); // System.out.println(node.getName()); } public void delNode(String name){ Node temp; Node node = this.getFirstNode(); do{ temp = node; if(node.getNextNode()!=nullnode.getNextNode().getName().equals(name)){ node = node.getNextNode().getNextNode(); temp.setNextNode(no