package com.sun.linkedlist;
import java.util.Stack;
public class DoubleLinkedListDemo {
public static void main(String[] args) {
//测试
HeroNode hero1=new HeroNode(1,"宋江","及时雨");
HeroNode hero2=new HeroNode(2,"无用","玉麒麟");
HeroNode hero3=new HeroNode(3,"林冲","豹子头");
HeroNode hero4=new HeroNode(4,"卢俊义","狮子头");
SingLinkedList linkedList =new SingLinkedList();
linkedList.addByOrder(hero1);
linkedList.addByOrder(hero3);
linkedList.addByOrder(hero2);
linkedList.addByOrder(hero4);
//修改节点
// HeroNode newhero=new HeroNode(2,"小二","火麒麟");
// linkedList.update(newhero);
// linkedList.del(1);
// System.out.println(linkedList.getLength(linkedList.getHead()));
//linkedList.list();
// System.out.println("==========================================");
//
/*HeroNode node=SingLinkedList.findLastIndexNode(SingLinkedList.getHead(), 1);
System.out.println("------"+node);*/
// linkedList.fanzhuan(linkedList.getHead());
linkedList.list();
linkedList.reversePrint(SingLinkedList.getHead());
}
}
class DoubleLinkedList{
private static HeroNode2 head=new HeroNode2(0, "", "");
public static HeroNode2 getHead() {
return head;
}
public void setHead(HeroNode2 head) {
this.head = head;
}
//双向链表添加
public void add(HeroNode2 heroNode) {
HeroNode2 temp=head;
while(true)
{
if(temp.next==null){
break;
}
temp=temp.next;
}
temp.next=heroNode;
heroNode.pre=temp;
}
// 遍历链表
public void list() {
if(head.next==null){
System.out.println("链表为空");
return;
}
//因为头结点不能动,需要一个辅助变量来遍历
HeroNode2 temp=head.next;
while(true){
if(temp==null){
break;
}
System.out.println(temp);
temp=temp.next;
}
}
//按照序号添加节点
public void addByOrder(HeroNode2 heroNode) {
HeroNode2 temp=head;
boolean flag=false;
while(true){
if(temp.next == null){
break;
}
if(temp.next.no > heroNode.no){
break;
}else if (temp.next.no == heroNode.no) {
flag=true;//编号已存在
break;
}
temp=temp.next;
}
if(flag){
System.out.printf("编号已存在%d\n",heroNode.no);
}
else {
heroNode.next=temp.next;
temp.next=heroNode;
}
}
// 修改节点
public void update(HeroNode2 heroNode) {
if(head.next ==null){
System.out.println("链表为空");
return;
}
//定义一个辅助变量
HeroNode2 temp=head.next;
boolean flag=false;//表示是否找到节点
while(true){
if(temp == null){
break;
}
if(temp.no==heroNode.no){
flag=true;
break;
}
temp=temp.next;
}
if(flag){
temp.name=heroNode.name;
temp.nickname=heroNode.nickname;
}else{
System.out.println("没有找到编号");
}
}
//删除节点,对于双向链表 ,可以直接找到这个节点,不需要找到前一个节点
public void del(int no) {
HeroNode2 temp=head.next;//辅助指针
boolean flag = false;
while(true){
//遍历完
if(temp== null){
break;
}
if(temp.no == no){
flag=true;
break;
}
temp = temp.next;
}
if(flag){
temp.pre.next=temp.next;
if(temp.next !=null){
temp.next.pre=temp.pre;
}
}else{
System.out.println("要删除的节点不存在");
}
}
}
class HeroNode2{
public int no;
public String name;
public String nickname;
public HeroNode2 next;
public HeroNode2 pre;//指向前一个节点
public HeroNode2(int no, String name, String nickname) {
super();
this.no = no;
this.name = name;
this.nickname = nickname;
}
@Override
public String toString() {
return "HeroNode [no=" + no + ", name=" + name + ", nickname="
+ nickname + "]";
}
}
环形链表增删改查
猜你喜欢
转载自blog.csdn.net/qq_40709110/article/details/100736856
今日推荐
周排行