數據結構學習（一）：單鏈表

一、單鏈表定義

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 + '\'' +
                ", next=" + next +
                '}';
    }
}

二、添加節點

public void add(HeroNode heroNode) {
        HeroNode temp = head;
        //遍歷鏈表，找到最後
        while (true) {
            if(temp.next == null) {
                break;
            }
            temp = temp.next;
        }
        //退出while時候,temp就指向了鏈表的最後,指向新的node
        temp.next = heroNode;
    }

三、按照順序添加節點

//根據序號將node插入到指定位置
    public void addByOrder(HeroNode heroNode) {
        //頭節點不能動，所以要一個輔助變量來遍歷
        HeroNode temp = head;
        //標識添加的編號是否存在
        boolean flag = false;

        //遍歷鏈表，找到最後
        while (true) {
            if(temp.next == null) {
                break;
            }

            //找到位置， 在temp後面插入
            if(temp.next.no > heroNode.no) {
                break;
            }else if(temp.next.no == heroNode.no) {//希望添加的node的編號已經存在
                flag = true;
                break;
            }
            temp = temp.next;
        }

        //判斷flag的值
        if(flag) {//不能添加，說明編號存在
            System.out.println(heroNode.no + " cun zai");
        }else {
            //插入到鏈表中,temp的後面
            heroNode.next = temp.next;
            temp.next = heroNode;
        }
    }

四、按照順序顯示鏈表

public void list() {
        if(head.next == null) {
            System.out.println("null");
            return;
        }

        //頭節點不能動，所以要一個輔助變量來遍歷
        HeroNode temp = head.next;
        while (true) {
            if(temp == null) {
                break;
            }
            System.out.println(temp);
            temp = temp.next;
        }
    }

五、編輯節點

//修改節點信息，根據編號來改正，但編號不能改正
    public void update(HeroNode newHeroNode) {
        if(head.next == null) {
            System.out.println("LinkedList is null~~");
            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;
        }

        //根據flag判斷是否找到要修改的node
        if(flag) {
            temp.name = newHeroNode.name;
            temp.nickname = newHeroNode.nickname;
        }else {
            System.out.println("no find " + newHeroNode.no);
        }
    }

六、刪除節點

 //刪除節點
    public void del(int no) {
        HeroNode temp = head;
        //標識是否找到節點
        boolean flag = false;
        while (true) {
            if(temp.next == null) {
                break;
            }

            //找到待刪除節點的前一個節點temp
            if(temp.next.no == no) {
                flag = true;
                break;
            }

            temp = temp.next;
        }

        if(flag) {
            temp.next = temp.next.next;
        }else {
            System.out.println("bu cun zai " + no);
        }
    }

七、定義頭結點

private HeroNode head = new HeroNode(0, "", "");

八、測試

 public static void main(String[] args) {
        HeroNode heroNode1 = new HeroNode(1,"1","1");
        HeroNode heroNode2 = new HeroNode(2,"2","2");
        HeroNode heroNode3 = new HeroNode(3,"3","3");
        HeroNode heroNode4 = new HeroNode(4,"4","4");

        SingleLinkedList singleLinkedList = new SingleLinkedList();

//        //加入
//        singleLinkedList.add(heroNode1);
//        singleLinkedList.add(heroNode2);
//        singleLinkedList.add(heroNode3);
//        singleLinkedList.add(heroNode4);

        //按照編號加入
        singleLinkedList.addByOrder(heroNode1);
        singleLinkedList.addByOrder(heroNode4);
        singleLinkedList.addByOrder(heroNode3);
        singleLinkedList.addByOrder(heroNode2);
        singleLinkedList.addByOrder(heroNode1);

        singleLinkedList.list();

        System.out.println();

        //修改
        HeroNode newNode = new HeroNode(2, "22", "22");
        singleLinkedList.update(newNode);

        singleLinkedList.list();

        singleLinkedList.del(1);
        System.out.println();
        singleLinkedList.list();
    }