java单向链表实现,java单向链表的实现实例

package ncu.com.app.chatpter_5;

import java.util.Random;

//结点类

class Node {

Object data;

Node next;

}

//操作类

class ListNode{

public Node first;

public int size;

public ListNode(){

first &＃61; null;

size &＃61; 0;

}

public void insertNode(Object node){

Node no &＃61; new Node();

no.data &＃61; node;

no.next &＃61; first;

first &＃61; no;

size&＃43;&＃43;;

}

public void disPlay(){

if(size&＃61;&＃61;0){

System.out.println("链表为空");

}

Node currnode &＃61; first;

while(currnode!&＃61;null){

System.out.print(currnode.data&＃43;",");

currnode &＃61; currnode.next;

}

System.out.println("");

}

//删除i个结点

public void delect(int i){

if(i<&＃61;size){

for(int m&＃61;0;m

first &＃61; first.next;

size--;

disPlay();

}

}

}

//清空链表

public void delectAll(){

size &＃61; 0;

first &＃61; null;

disPlay();

}

//获得从i-j中链表的数据

public void getNode(int i,int j){

for(int m&＃61;0;m

first &＃61; first.next;

}

Node currnode &＃61; first;

for(int m&＃61;0;m

System.out.print(currnode.data&＃43;",");

currnode &＃61; currnode.next;

}

}

}

public class NodeTree {

public static void main(String args[]){

ListNode listnode &＃61; new ListNode();

for(int i &＃61; 0;i<10;i&＃43;&＃43;){

int k  &＃61; new Random().nextInt(10);

listnode.insertNode(k);

System.out.print(k&＃43;",");

}

System.out.println("");

listnode.disPlay();

//listnode.delect(10);

//listnode.delectAll();

listnode.getNode(2,8);

}

}