Java_手动实现链表操作

/* * Author: MengLei * Function: 实现双向线性链表：建立，删除，修改值，查找一个节点，查找多个节点，添加，删除等。 */public class Temp {public static void main(String[] args) {Link link = new Link();link.createLink(10);//创建一个拥有10个node的链表link.printLink();//输出：0 --> 1 --> 2 --> 3 --> 4 --> 5 --> 6 --> 7 --> 8 --> 9Node foundNode = link.find(8);//查找值为8的节点System.out.println(foundNode);//输出：Node@c17164。说明返回了一个节点foundNode = link.find(18);//查找值为18的节点System.out.println(foundNode);//输出：null。说明没有找到节点link.setNodeValue(2, 5);//将第三个节点的值改为5link.printLink();//0 --> 1 --> 5 --> 3 --> 4 --> 5 --> 6 --> 7 --> 8 --> 9link.append(new Node(99));//在链表尾部添加一个值为99的节点link.printLink();//输出：0 --> 1 --> 5 --> 3 --> 4 --> 5 --> 6 --> 7 --> 8 --> 9 --> 99Link resultLink = link.findAll(18);//查找所有值为18的节点System.out.println(resultLink);//输出：null。说明没有找到值为18的节点resultLink = link.findAll(5);//查找所有值为18的节点System.out.println(resultLink);//输出：Link@1fb8ee3。说明找到了值为5的节点，并创建了一个新Link用于存储找到的节点（值相同，但与找到的节点不是同一个节点）resultLink.printLink();//输出：5 --> 5link.add(2, new Node(88));//在第三个节点后添加值为88的新节点link.printLink();//输出：0 --> 1 --> 5 --> 88 --> 3 --> 4 --> 5 --> 6 --> 7 --> 8 --> 9 --> 99link.delete(3);//删除第四个节点link.printLink();//输出：0 --> 1 --> 5 --> 3 --> 4 --> 5 --> 6 --> 7 --> 8 --> 9 --> 99}}class Node {//节点类private int value;private Node previous;//存储前一个节点private Node next;//存储下一个节点Node(int value) {//构造器，需要传入一个int值this.value = value;}public int getValue() {return value;}public void setValue(int value) {this.value = value;}public Node getPrevious() {return previous;}public void setPrevious(Node previous) {this.previous = previous;}public Node getNext() {return next;}public void setNext(Node next) {this.next = next;}}class Link {//链表类private Node head;//存储头结点private Node last;//存储尾节点private int length; //存储链表长度public Node getHead() {return head;}public void setHead(Node head) {this.head = head;}public Node getLast() {return last;}public void setLast(Node last) {this.last = last;}public int getLength() {return length;}public void setLength(int length) {this.length = length;}public void createLink(int linkLength) {//建立链表,参数：链表长度Node temp = null;//存储临时节点if (linkLength <= 0) {System.out.println("Error：链表长度不能小于1！");}else {for (int i=0;i<linkLength;i++) {if (i == 0) {//如果是第一个节点this.setHead(new Node(i));//用i作为节点的值，以便查看建立顺序。this.getHead().setPrevious(null);//这句话其实没有意义，因为head节点的previous节点初始化时就已经是null了。这句话只是为了表明head节点的previous值应该为null。temp = this.getHead();}else {Node node = new Node(i);temp.setNext(node);temp = node;}if (i == linkLength-1) {this.setLast(temp);temp.setNext(null);}}this.setLength(linkLength);//设置链表长度}}public void printLink() {//打印链表if (this.getHead() != null) {System.out.print(this.getHead().getValue());Node temp = this.getHead();while (temp.getNext() != null) {System.out.print(" --> " + temp.getNext().getValue());temp = temp.getNext();}System.out.println("");}}public void deleteLink() {//删除链表this.setHead(null);this.setLast(null);this.setLength(0);}public void setNodeValue(int pos, int value) {//修改下标为pos的节点的值为valueif (pos > this.getLength()-1) {System.out.println("Error：传入的节点位数大于链表长度！");}else {Node temp = this.getHead();for (int i=0;i<pos;i++) {temp = temp.getNext();}temp.setValue(value);}}public void append(Node node) {//在链表尾部添加一个节点if (this.getHead() == null && this.getLast() == null) {this.setHead(node);this.setLast(node);node.setNext(null);this.setLength(1);}else {this.getLast().setNext(node);this.setLast(node);node.setNext(null);this.setLength(this.getLength()+1);}}public void add(int pos, Node node) {//在下标为pos的位置后添加一个新节点if (this.getHead() == null && this.getLast() == null) {this.setHead(node);this.setLast(node);node.setNext(null);this.setLength(1);}else {if (pos > this.getLength()-1) {System.out.println("Error：传入的节点位数大于链表长度！");}else {Node temp = this.getHead();for (int i=0;i<pos;i++) {temp = temp.getNext();}node.setNext(temp.getNext());node.setPrevious(temp);temp.getNext().setPrevious(node);temp.setNext(node);this.setLength(this.getLength()+1);}}}public void delete(int pos) {//删除下标为pos的节点if (this.getHead() == null && this.getLast() == null) {System.out.println("Error：链表中没有节点！");}else {if (pos > this.getLength()-1) {System.out.println("Error：传入的节点位数大于链表长度！");}else {Node temp = this.getHead();for (int i=0;i<pos-1;i++) {temp = temp.getNext();}temp.setNext(temp.getNext().getNext());temp.getNext().setPrevious(temp);this.setLength(this.getLength()-1);}}}public Node find(int value) {//输出值为value的第一个节点Node temp = this.getHead();if (temp != null) {if (temp.getValue() == value)return temp;else {while(temp.getNext() != null) {temp = temp.getNext();if (temp.getValue() == value)return temp;}return null;}}elsereturn null;}public Link findAll(int value) {//输出所有值为value的节点，并将所有节点组成一个Link返回Link resultLink = new Link();Node temp = this.getHead();if (temp != null) {do {if (temp.getValue() == value) {resultLink.append(new Node(temp.getValue()));//这里只能添加与找到的节点值相同的新节点，因为如果添加temp的话，会造成原链表的混乱}temp = temp.getNext();}while(temp.getNext() != null);if (resultLink.getHead() == null) {return null;}return resultLink;}elsereturn null;}}