Java-数据结构-链表全操作(增,删,改)
链表完成,部分地方看了看教程,思想方法已经明白,以后会单独回敲一下–
下一阶段栈
package SJJG;
public class SingleLinkedListDemo {
public static void main(String[] args) {
Node node1 = new Node(1,"宋江","及时雨");
Node node2 = new Node(2,"卢俊义","玉麒麟");
Node node3 = new Node(3,"吴用","智多星");
Node node4 = new Node(4,"林冲","豹子头");
SingleLinkedListNode singlelinkedlistnode = new SingleLinkedListNode();
singlelinkedlistnode.addbyorder(node1);
singlelinkedlistnode.addbyorder(node4);
singlelinkedlistnode.addbyorder(node2);
singlelinkedlistnode.addbyorder(node3);
singlelinkedlistnode.list();
Node newnode = new Node(4,"MC.大冲","MC.我豹哥");
singlelinkedlistnode.update(newnode);
System.out.printf("修改后的情况\n");
singlelinkedlistnode.list();
singlelinkedlistnode.del(2);
System.out.printf("删除后的情况\n");
singlelinkedlistnode.list();
}
}
class SingleLinkedListNode {
private Node head = new Node(0,"","");
public void add(Node node) {
Node temp = head;
while(true) {
if(temp.next==null) {
break;
}
temp = temp.next;
}
temp.next = node;
}
public void addbyorder(Node node) {
Node temp = head;
boolean flag = false;
while(true) {
if(temp.next==null) {
break;
}
if(temp.next.no>node.no) {
break;
}else if(temp.next.no==node.no) {
flag=true;
break;
}
temp = temp.next;
}
if(flag) {
System.out.printf("编号%d已经存在,不能加入\n",node.no);
}else {
node.next = temp.next;
temp.next = node;
}
}
public void list() {
if(head.next==null) {
System.out.println("链表为空~~~~");
return;
}
Node temp = head;
while(true) {
if(temp==null) {
break;
}
System.out.println(temp);
temp = temp.next;
}
}
public void update(Node newnode) {
if(head.next ==null) {
System.out.printf("链表为空。无法修改节点\n");
return;
}
Node temp = head.next;
boolean flag = false;
while(true) {
if(temp==null) {
break;
}
if(temp.no ==newnode.no) {
flag = true;
break;
}
temp = temp.next;
}
if(flag) {
temp.name = newnode.name;
temp.nickname = newnode.nickname;
}else {
System.out.printf("没有找到编号为%d的节点", newnode.no);
}
}
public void del(int no) {
if(head.next ==null) {
System.out.printf("链表为空。无法删除修改节点\n");
return;
}
Node temp = head.next;
boolean flag = false;
while(true) {
if(temp==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);
}
}
}
class Node{
public int no;
public String name;
public String nickname;
public Node next;
public Node(int Nno,String Nname,String Nnickname) {
this.no = Nno;
this.name = Nname;
this.nickname = Nnickname;
}
@Override
public String toString() {
return "Node [no=" + no + ", name=" + name + ", nickname=" + nickname + "]";
}
}