devbox
正经夜光杯
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

Java数据结构：链表_链表 java

作者：正经夜光杯 | 2024-07-14 03:52:37

赞

踩

链表 java

目录

一、单链表

二、双向链表

一、单链表

（1）链表是以节点的方式存储

（2）每个节点包含date域，next域：指向下一个结点

（3）链表的结点不一定是连续存储

（4）链表分带头结点的的链表和没有带头节点的链表，根据实际需求来确定

使用带头的单

  1. package LinkList;
  2. class HeroNode1 {
  3.     private int no;
  4.     private String name;
  5.     private String nickName;
  6.     public HeroNode1 next;//指向下一个节点
  7.     public HeroNode1 prior;//指向前一个节点
  8.     public HeroNode1(int no, String name, String nickName) {
  9.         this.no = no;
  10.         this.name = name;
  11.         this.nickName = nickName;
  12.     }
  13.  
  14.     @Override
  15.     public String toString() {
  16.         return "HeroNode1{" +
  17.                 "no=" + no +
  18.                 ", name='" + name + '\'' +
  19.                 ", nickName='" + nickName + '\'' +
  20.                 '}';
  21.     }
  22.  
  23.     public int getNo() {
  24.         return no;
  25.     }
  26.  
  27.     public void setNo(int no) {
  28.         this.no = no;
  29.     }
  30.  
  31.     public String getName() {
  32.         return name;
  33.     }
  34.  
  35.     public void setName(String name) {
  36.         this.name = name;
  37.     }
  38.  
  39.     public String getNickName() {
  40.         return nickName;
  41.     }
  42.  
  43.     public void setNickName(String nickName) {
  44.         this.nickName = nickName;
  45.     }
  46.  
  47.     public HeroNode1 getNext() {
  48.         return next;
  49.     }
  50.  
  51.     public void setNext(HeroNode1 next) {
  52.         this.next = next;
  53.     }
  54.  
  55.     public HeroNode1 getPrior() {
  56.         return prior;
  57.     }
  58.  
  59.     public void setPrior(HeroNode1 prior) {
  60.         this.prior = prior;
  61.     }
  62. }
  63. class DoubleLinkedList{
  64.     private HeroNode1 head=new HeroNode1 (0,"","");
  65.  
  66.     public DoubleLinkedList() {
  67.     }
  68.  
  69.     //添加
  70.     public void add(HeroNode1 hero){
  71.         HeroNode1 temp=head;
  72.         while(temp.next!=null){
  73.             temp=temp.next;
  74.         }
  75.         temp.next=hero;
  76.         hero.prior=temp;
  77.     }
  78.     //删除
  79.     public void delete(int no){
  80.         if(head.next==null){
  81.             System.out.println ("该链表为空，删除失败！" );
  82.             return;
  83.         }
  84.         HeroNode1 temp=head.next;
  85.         while(temp.getNo ()!=no){
  86.             temp=temp.next;
  87.         }
  88.         temp.prior.next=temp.next;
  89.         if (temp!=null){
  90.             temp.next.prior=temp.prior;
  91.         }
  92.     }
  93.     //修改
  94.     public void update(HeroNode1 newHero){
  95.         HeroNode1 temp=head;
  96.         while(true){
  97.             if(temp.next==null){
  98.                 System.out.println ("未找到要修改的节点" );
  99.                 return;
  100.             }
  101.  
  102.             if(temp.getNo ()==newHero.getNo ()){
  103.                 break;
  104.             }
  105.             temp=temp.next;
  106.         }
  107.         temp.setNo (newHero.getNo ());
  108.         temp.setName (newHero.getName ());
  109.         temp.setNickName (newHero.getNickName ());
  110.         System.out.println ("修改成功！" );
  111.     }
  112.     //遍历
  113.     public void list(){
  114.         if(head.next==null){
  115.             System.out.println ("此链表为空！" );
  116.             return;
  117.         }
  118.         HeroNode1 temp=head.next;
  119.         while(temp!=null){
  120.             System.out.println (temp );
  121.             temp=temp.next;
  122.         }
  123.     }
  124. }
  125. public class DoubleLinkedListDemo {
  126.     public static void main(String[] args) {
  127.         DoubleLinkedList doubleList = new DoubleLinkedList ( );
  128.         HeroNode1 hero1 = new HeroNode1 (1, "宋江", "及时雨");
  129.         HeroNode1 hero2 = new HeroNode1 (2, "卢俊义", "玉麒麟");
  130.         HeroNode1 hero3 = new HeroNode1 (3, "吴用", "智多星");
  131.         HeroNode1 hero4 = new HeroNode1 (4, "林冲", "豹子头");
  132.         doubleList.add (hero1);
  133.         doubleList.add (hero2);
  134.         doubleList.add (hero3);
  135.         doubleList.add (hero4);
  136.         doubleList.list ();
  137.         doubleList.delete (2);
  138.         HeroNode1 newHero = new HeroNode1 (3, "凌不疑", "081");
  139.         doubleList.update (newHero);
  140.         doubleList.list ();
  141.     }
  142. }

链表实现水浒英雄排行榜管理，要求如下：

（1）完成对英雄人物的增删改查操作

（2）第一种方法在添加英雄时，直接添加到链表的尾部

（3）第二种方式在添加英雄时，根据排名蒋英雄插入到指定位置（如果有这个排名，则添加失败，并给出提示）

示意图：

二、双向链表

双向链表相比单链表存在以下优点：

（1）单链表查找的方向只能是一个方向，而双向链表可以向前或向后进行查找

（2）单链表不能自我删除，需要辅助节点，而双向链表可以进行自我删除

示意图为：

使用双向链表实现水浒英雄排行榜进行增删改查操作：

  1. package LinkList;
  2. class HeroNode1 {
  3.     private int no;
  4.     private String name;
  5.     private String nickName;
  6.     public HeroNode1 next;//指向下一个节点
  7.     public HeroNode1 prior;//指向前一个节点
  8.     public HeroNode1(int no, String name, String nickName) {
  9.         this.no = no;
  10.         this.name = name;
  11.         this.nickName = nickName;
  12.     }
  13.  
  14.     @Override
  15.     public String toString() {
  16.         return "HeroNode1{" +
  17.                 "no=" + no +
  18.                 ", name='" + name + '\'' +
  19.                 ", nickName='" + nickName + '\'' +
  20.                 '}';
  21.     }
  22.  
  23.     public int getNo() {
  24.         return no;
  25.     }
  26.  
  27.     public void setNo(int no) {
  28.         this.no = no;
  29.     }
  30.  
  31.     public String getName() {
  32.         return name;
  33.     }
  34.  
  35.     public void setName(String name) {
  36.         this.name = name;
  37.     }
  38.  
  39.     public String getNickName() {
  40.         return nickName;
  41.     }
  42.  
  43.     public void setNickName(String nickName) {
  44.         this.nickName = nickName;
  45.     }
  46.  
  47.     public HeroNode1 getNext() {
  48.         return next;
  49.     }
  50.  
  51.     public void setNext(HeroNode1 next) {
  52.         this.next = next;
  53.     }
  54.  
  55.     public HeroNode1 getPrior() {
  56.         return prior;
  57.     }
  58.  
  59.     public void setPrior(HeroNode1 prior) {
  60.         this.prior = prior;
  61.     }
  62. }
  63. class DoubleLinkedList{
  64.     private HeroNode1 head=new HeroNode1 (0,"","");
  65.  
  66.     public DoubleLinkedList() {
  67.     }
  68.  
  69.     //添加
  70.     public void add(HeroNode1 hero){
  71.         HeroNode1 temp=head;
  72.         while(temp.next!=null){
  73.             temp=temp.next;
  74.         }
  75.         temp.next=hero;
  76.         hero.prior=temp;
  77.     }
  78.     //删除
  79.     public void delete(int no){
  80.         if(head.next==null){
  81.             System.out.println ("该链表为空，删除失败！" );
  82.             return;
  83.         }
  84.         HeroNode1 temp=head.next;
  85.         while(temp.getNo ()!=no){
  86.             temp=temp.next;
  87.         }
  88.         temp.prior.next=temp.next;
  89.         if (temp!=null){
  90.             temp.next.prior=temp.prior;
  91.         }
  92.     }
  93.     //修改
  94.     public void update(HeroNode1 newHero){
  95.         HeroNode1 temp=head;
  96.         while(true){
  97.             if(temp.next==null){
  98.                 System.out.println ("未找到要修改的节点" );
  99.                 return;
  100.             }
  101.  
  102.             if(temp.getNo ()==newHero.getNo ()){
  103.                 break;
  104.             }
  105.             temp=temp.next;
  106.         }
  107.         temp.setNo (newHero.getNo ());
  108.         temp.setName (newHero.getName ());
  109.         temp.setNickName (newHero.getNickName ());
  110.         System.out.println ("修改成功！" );
  111.     }
  112.     //遍历
  113.     public void list(){
  114.         if(head.next==null){
  115.             System.out.println ("此链表为空！" );
  116.             return;
  117.         }
  118.         HeroNode1 temp=head.next;
  119.         while(temp!=null){
  120.             System.out.println (temp );
  121.             temp=temp.next;
  122.         }
  123.     }
  124. }
  125. public class DoubleLinkedListDemo {
  126.     public static void main(String[] args) {
  127.         DoubleLinkedList doubleList = new DoubleLinkedList ( );
  128.         HeroNode1 hero1 = new HeroNode1 (1, "宋江", "及时雨");
  129.         HeroNode1 hero2 = new HeroNode1 (2, "卢俊义", "玉麒麟");
  130.         HeroNode1 hero3 = new HeroNode1 (3, "吴用", "智多星");
  131.         HeroNode1 hero4 = new HeroNode1 (4, "林冲", "豹子头");
  132.         doubleList.add (hero1);
  133.         doubleList.add (hero2);
  134.         doubleList.add (hero3);
  135.         doubleList.add (hero4);
  136.         doubleList.list ();
  137.         doubleList.delete (2);
  138.         HeroNode1 newHero = new HeroNode1 (3, "凌不疑", "081");
  139.         doubleList.update (newHero);
  140.         doubleList.list ();
  141.     }
  142. }

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/正经夜光杯/article/detail/823014
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号