链表基础增删改查操作代码

**

链表基础操作：增删改查 代码

**
package com.mia.linkedlist;

import javafx.beans.property.SimpleListProperty;

import java.text.SimpleDateFormat;

public class SingleLinkedListDemo {
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, “小灰灰”, “灰太狼儿子”);

    SingleLinkedList singleLinkedList = new SingleLinkedList();
    //加入数据
   /* singleLinkedList.add(hero1);
    singleLinkedList.add(hero2);
    singleLinkedList.add(hero3);
    singleLinkedList.add(hero4);  */

    singleLinkedList.addByOrder(hero1);
    singleLinkedList.addByOrder(hero2);
    singleLinkedList.addByOrder(hero3);
    singleLinkedList.addByOrder(hero4);

    singleLinkedList.list();

    HeroNode newHeroNode = new HeroNode(2, "小纪", "大脑袋");
    singleLinkedList.upData(newHeroNode);

    System.out.println("修改后链表情况");
    singleLinkedList.list();

    singleLinkedList.del(4);
    System.out.println("修改后链表情况");
    singleLinkedList.list();
}

}

/**

• 定义SingleLinkedList 管理我们的英雄
  */

class SingleLinkedList {
// 先初始化头节点，不能动,不存在具体的数据
private HeroNode head = new HeroNode(0, “”, “”);
/**
* 增加
/
//添加节点到单项链表中
//思路 当不考虑编号顺序时
//1. 找到当前链表的最后节点
//2. 将最后这个节点的next 指向新的节点
public void add(HeroNode heroNode) {
HeroNode temp = head;
while (true) {
if (temp.next == null) {
break;
}
temp = temp.next;
}
temp.next = heroNode;
}
//单链表按顺序 插入数据
public void addByOrder(HeroNode heroNode) {
HeroNode 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,无法添加”, heroNode.no);
} else {
heroNode.next = temp.next;
temp.next = heroNode;
}
}
/*
* 删除操作
*/
public void del(int no) {
HeroNode 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.println(“要删除的节点不存在”);
}

}
/**
 * 修改节点信息，根据no编号
 */
public void upData(HeroNode newHeroNode) {
    //判断是否为空
    if (head.next == null) {
        System.out.println(" 链表为空~~~");
        return;
    }
    HeroNode temp = head.next;
    boolean flag = false;
    while (true) {
        if (temp == null) break;
        if (temp.no == newHeroNode.no) {
            flag = true;
            break;
        }
        temp = temp.next;
    }

    if (flag) {
        temp.name = newHeroNode.name;
        temp.nickname = newHeroNode.nickname;
    } else {
        System.out.println(" 没有找到 ");
    }


}
/**
 * 查找
 */
// 显示链表 遍历
public void list() {
    if (head.next == null) {
        System.out.println("链表为空");
        return;
    }
    HeroNode temp = head.next;
    while (true) {
        if (temp == null) {
            break;
        }
        System.out.println(temp);
        temp = temp.next;
    }

}

}
//定义HeroNode ， 每个HeroNode 就是一个节点
class HeroNode {
public int no;
public String name;
public String nickname;
public HeroNode next;

// 构造器
public HeroNode(int no, String name, String nickname) {
    this.no = no;
    this.name = name;
    this.nickname = nickname;
}
@Override
public String toString() {
    return "HeroNode{" +
            "no=" + no +
            ", name='" + name + '\'' +
            ", nickname='" + nickname + '\'' +
            '}';
}

}