单链表代码实现

package com.linkedlist;

import java.util.Stack;

public class SingleLinkedListDemo {
    public static void main(String[] args) {
        //先创建节点
        HeroNode hero1 = new HeroNode(1, "松江", "及时雨");
        HeroNode hero2 = new HeroNode(2, "松江1", "及时雨3");
        HeroNode hero3 = new HeroNode(3, "松江2", "及时雨3");
        HeroNode hero4 = new HeroNode(4, "松江3", "及时雨4");
        SingleLinkedList singleLinkedList = new SingleLinkedList();
//        singleLinkedList.add(hero1);
//        singleLinkedList.add(hero2);
//        singleLinkedList.add(hero3);
//        singleLinkedList.add(hero4);
        singleLinkedList.addByOrder(hero1);
        singleLinkedList.addByOrder(hero4);
        singleLinkedList.addByOrder(hero2);
        singleLinkedList.addByOrder(hero3);
        singleLinkedList.addByOrder(hero3);



        //测试修改节点
        HeroNode newH = new HeroNode(2, "e", "sgd");
        singleLinkedList.update(newH);

        singleLinkedList.delet(5);
        singleLinkedList.list();
        System.out.println("有效的节点个数"+getLength(singleLinkedList.getHead()));


        HeroNode res = findLatIndexNode(singleLinkedList.getHead(),2);
        System.out.println("res"+res);



        //测试单链表反转
        System.out.println("原来链表的情况");
        singleLinkedList.list();
        System.out.println("反转的");
      reversetList(singleLinkedList.getHead());
      singleLinkedList.list();


        System.out.println("测试逆序打印单链表");
        reversePrint(singleLinkedList.getHead());
    }

    public static void reversePrint(HeroNode head){
        if (head.next== null){
            return;
        }
        Stack<HeroNode> stack = new Stack<>();
        HeroNode cur = head.next;
        while (cur!=null){
            stack.push(cur);
            cur = cur.next;
        }
        while (stack.size()>0){
            System.out.println(stack.pop());
        }

    }

    //将单链表反转

    public static void reversetList(HeroNode head){
        if (head.next == null|| head.next.next ==null){
            return;
        }
        //定义一个辅助的指针（变量），帮助遍历原来的链表
        HeroNode cur = head.next;
        HeroNode next = null;
        HeroNode reverseHead = new HeroNode(0,"","");

        while (cur !=null){
            next =cur.next;
            cur.next = reverseHead.next;
            reverseHead.next = cur;
            cur = next;
        }
        //将head.next 指向reverseHead.next,实现单链表的反转
        head.next =reverseHead.next;
    }



    public static HeroNode findLatIndexNode(HeroNode head,int index){
        if (head.next == null){
            return null;
        }
        int size = getLength(head);
        if (index <=0 || index >size){
            return null;
        }
        //定义一个辅助变量
        HeroNode cur = head.next;
        for (int i = 0;i<size-index;i++){
            cur = cur.next;
        }
        return cur;
    }


    //获取到单链表的节点的个数
    public static int getLength(HeroNode head){
        if (head.next == null){
            return 0;
        }
        int length = 0;
        HeroNode cur = head.next;
        while (cur!=null){
            length++;
            cur = cur.next;//遍历
        }
        return length;

    }
}

class SingleLinkedList {
    //先初始化一个头节点，头节点不能动
    private HeroNode head = new HeroNode(0, "", "");


    public HeroNode getHead(){
        return head;
    }

    //添加节点
    //1.思路  1.找到当前链表的最后节点 2.将最后这个节点的next 指向 新的节点
    public void add(HeroNode heroNode) {
        HeroNode tem = head;
        while (true) {
            if (tem.next == null) {
                break;
            }
            tem = tem.next;

        }
        tem.next = heroNode;
    }

    public void addByOrder(HeroNode heroNode){
        HeroNode temp = head;
        boolean flag = false;//标志添加的编号是否存在，默认为false
        while (true){
            if (temp.next==null){
                break;
            }
            if (temp.next.no>heroNode.no){//位置找到，就在temp的后面插入
                break;

            }else if (temp.next.no == heroNode.no){
                flag = true;//说明编号存在
                break;
            }
            temp = temp.next;//后移，遍历当前链表

        }
        if (flag){
            System.out.printf("准备插入的英雄的编号%d已经存在，不能加入\n",heroNode.no);
        }else {
            //插入到链表中，temp的后面
            heroNode.next = temp.next;
            temp.next = heroNode;
        }
    }



    //修改节点的信息，根据no编号来修改，no不变

    public void update(HeroNode newHeroNode){
        if (head.next== null){
            System.out.println("链表为空~");
            return;
        }
        //找到需要修改的节点，根据no编号
        HeroNode temp = head.next;
        boolean flag = false;
        while (true){
            if (temp == null){
                break;//遍历链表结束
            }
            if (temp.no == newHeroNode.no){
                //找到
                flag = true;
                break;
            }
            temp = temp.next;
        }
        //根据flag 判断是否找到要修改的节点
        if (flag){
            temp.name = newHeroNode.name;
            temp.nickname = newHeroNode.nickname;
        }else{
            System.out.printf("没有找到编号%d的节点，不能修改\n",newHeroNode.no);
        }

    }


    //删除
    public void delet(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.printf("要删除的%d 的节点不存在",no);
        }

    }
    //显示链表【遍历】
    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 = temp.next;
        }
    }

}


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 + '\'' +
                '}';
    }
}