数据结构复习--java实现单链表基本操作

单链表的基本操作包括建立单链表、查找运算（按序查找和按值查找）、插入运算（前插和后插）和删除运算。下面给出具体的java实现程序：

package com.zpp.test;
//首先创建一个节点类
public class Node {
     private Node next; //指针域
     private int data;//数据域
     
     public Node( int data) {
           this. data = data;
     }
     
  }

package com.zpp.test;
public class LinkList {
     public Node first; // 定义一个头节点
     private int pos = 0;// 节点的位置


     public LinkList() {
           this. first = null;
     }


     // 插入一个头节点
     public void addFirstNode( int data) {
          Node node = new Node(data);
          node. next = first;
           first = node;
     }


     // 删除头节点,并返回头节点
     public Node deleteFirstNode() {
          Node tempNode = first;
           first = tempNode. next;
           return tempNode;
     }


     // 在指定位置index的后面插入节点 
     public void insertAfter(int index, int data) {
          Node node = new Node(data);
          Node current = first;
           while ( pos != index) {
              current = current. next;
               pos++;
          }
          node. next = current.next;
          current. next = node;
           pos = 0;
     }


     // 在指定位置index的前面插入节点 
     public void insertBefore(int index, int data) {
          Node node = new Node(data);
          Node current = first;
          Node previous = first;
           while ( pos != index) {
              previous = current;
              current = current. next;
               pos++;
          }
          node. next = current;
          previous. next = node;
           pos = 0;
     }  
     
     // 删除指定位置的节点
     public void deleteByPos( int index) {
          Node current = first;
          Node previous = first;
           while ( pos != index) {
               pos++;
              previous = current;
              current = current. next;
          }
           if(current == first) {
               first = first. next;
          } else {
               pos = 0;
              previous. next = current. next;
          }
     }


     // 根据节点的data删除节点(仅仅删除第一个)
     public void deleteByData( int data) {
          Node current = first;
          Node previous = first; //记住上一个节点
           while (current. data != data) {
               if (current. next == null) {
              System.out.println("没有找到对应节点，无法进行删除操作！");
              }
              previous = current;
              current = current. next;
          }
           if(current == first) {
               first = first. next;
          } else {
              previous. next = current. next;
          }
     }




     // 根据位置查找节点信息
     public Node findByPos( int index) {
          Node current = first;
           if ( pos != index) {
              current = current. next;
               pos++;
          }
           return current;
     }


     // 根据数据查找节点信息
     public Node findByData( int data) {
          Node current = first;
           while (current. data != data) {
               if (current. next == null)
                    return null;
              current = current. next;
          }
           return current;
     }
     
  // 显示出所有的节点信息
     public void displayAllNodes() {
          Node current = first;
           while (current != null) {
              System.out.print(current.data+" ");
              
              current = current. next;
          }
           System.out.println();
     }
}


package com.zpp.test;
//测试类
public class TestLinkList {
     public static void main(String[] args) {
          LinkList linkList = new LinkList();
          linkList.addFirstNode(20);
          linkList.addFirstNode(21);
          linkList.addFirstNode(19);
           //19,21,20
          linkList.insertBefore(1, 22); //19,22,21,20
          linkList.insertBefore(2, 23); //19,22,23,21,20
          linkList.insertAfter(3, 99); //19,22,23,21,99,20
          linkList.displayAllNodes();
//        Node node = linkList.deleteFirstNode();
//        System.out.println("node : " + node.data);
//        linkList.displayAllNodes();
//        node = linkList.deleteByPos(2);
//        System.out.println("node : " + node.data);
//        linkList.displayAllNodes();
//        linkList.deleteFirstNode();
          linkList.deleteByData(19);
//        Node node = linkList.deleteByPos(0);
          //System. out.println( "node : " + node. data);
          linkList.displayAllNodes();
          Node node1 = linkList.findByPos(0);
          System. out.println( "node1: " + node1. data);
          Node node2 = linkList.findByData(22);
          System. out.println( "node2: " + node2. data);
     }
}