基于java数据结构实验 链表实验报告

实验报告

PersonNode cur=head.next;

while(cur!=null) {

length++;

cur=cur.next;

}

return length;

}

2 双向链表的实现

3 public static void reverselist(PersonNode head) {

if(head.next==null||head.next.next==null)//表为空或者只有一个节点

return;

PersonNode cur=head.next;

PersonNode next=null;

PersonNode reverseHead=new PersonNode(0, "");

while(cur!=null) {

next=cur.next;

cur.next=reverseHead.next;

reverseHead.next=cur;

cur=next;

}

head.next=reverseHead.next;

}

4

运行结果

单链表的测试及结果：

双链表的测试及结果：

附：源程序：

package linkedList;

public class SingleLinkedListDemo {

public static void main(String[] args) {

PersonNode person1= new PersonNode(1, "lihua");

PersonNode person2= new PersonNode(2, "wangfan");

PersonNode person3= new PersonNode(3, "wangxi");

PersonNode person4= new PersonNode(3, "xiaohu");

SingleLinkedList singlelist = new SingleLinkedList();

singlelist.add(person1);

// singlelist.add(person2);

singlelist.add(person3);

// singlelist.add(person4);

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

singlelist.list();

System.out.println("倒数第2个节点为：");

singlelist.daoshu(singlelist.getHead(), 2);

singlelist.addbyorder(person2);

System.out.println("插入后：");

singlelist.list();

singlelist.update(person4);

System.out.println("修改后：");

singlelist.list();

singlelist.del(2);

System.out.println("删除后：");

singlelist.list();

System.out.println("单链表的长度为

"+SingleLinkedList.getlength(singlelist.getHead()));

singlelist.reverselist(singlelist.getHead());

System.out.println("反转后：");

singlelist.list();

// TODO Auto-generated method stub

}

}

class PersonNode{

public int no;

public String name;

public PersonNode next;

public PersonNode(int no, String name) {

super();

this.no = no;

https://www.360docs.net/doc/8b13822204.html, = name;

}

public String toString() {

return"PersonNode [no="+no+",name="+name+"]";

}

}

class SingleLinkedList{

private PersonNode head = new PersonNode(0,"");

public PersonNode getHead() {

return head;

}

public void daoshu(PersonNode head,int k) { if(head.next==null)

return;

int size=getlength(head);

PersonNode temp = head.next;

int x=0;

while(temp!=null) {

x++;

if(x==size-k+1) {

System.out.println(temp);

break;

}

temp=temp.next;

}

}

public void reverselist(PersonNode head) {

if(head.next==null||head.next.next==null)

return;

PersonNode reversehead = new PersonNode(0, "");

PersonNode cur = head.next;

PersonNode nextnode = null;

while(cur!=null) {

nextnode=cur.next;

cur.next=reversehead.next;

reversehead.next=cur;

cur=nextnode;

}

head.next=reversehead.next;

}

//插入到队尾

public void add(PersonNode personnode) {

PersonNode temp = head;

//找到队尾

while(true) {

if(temp.next==null)

break;

temp=temp.next;

}

temp.next=personnode;

}

public void list() {

if(head.next==null) {

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

return;

}

PersonNode temp=head.next;

while(true) {

if(temp==null)

break;

System.out.println(temp);

temp=temp.next;

}

}

public void addbyorder(PersonNode newn) { if(head.next==null) {

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

return;

}

PersonNode temp=head.next;

boolean flag=false;

while(true) {

if(temp.next==null) {

break;

}

if(temp.next.no==newn.no) {

System.out.println("要插入的节点已存在");

break;

}

if(temp.next.no>newn.no) {

flag=true;

break;

}

temp=temp.next;

}

if(flag) {

newn.next=temp.next;

temp.next=newn;

}

}

public void update(PersonNode newn) {

if(head.next==null) {

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

return;

}

PersonNode temp = head.next;

boolean flag=false;

while(true) {

if(temp==null)

break;

if(temp.no==newn.no) {

flag=true;

break;

}

temp=temp.next;

}

if(flag) {

https://www.360docs.net/doc/8b13822204.html,=https://www.360docs.net/doc/8b13822204.html,;

}

else {

System.out.printf("没有找到编号为%d的节点，不能修改"+newn.no);

}

}

public void del(int no) {

PersonNode temp = head;

boolean flag=false;

while(true) {

if(temp.next==null)

break;

if(temp.next.no==no) {

flag=true;

break;

}

temp=temp.next;

}

if(flag) {

temp.next=temp.next.next;

}

else {

System.out.printf("要删除的节点%d不存在" +no);

}

}

public static int getlength(PersonNode head) {

if(head.next==null)

return 0;

PersonNode temp=head.next;

int length=0;

while(temp!=null) {

length++;

temp=temp.next;

}

return length;

}

}