雙向鏈表 添加與遍歷

package com.pay.test;
//定義節點
public class DoubleLinkedList {

    //初始化頭節點
    private  HeroNode head=new HeroNode(0,"","");

    //返回節點頭
    public HeroNode getHead(){
        return head;
    }

    /**
     * 雙向鏈表節點遍歷
     */
    public  void  list(){
        if(head.next==null){
            System.out.println("鏈表爲空");
            return;
        }

        HeroNode temp= head.next;
       while (true){
           if(temp==null){
                break;
           }
           //輸出節點信息
           temp.print();
           temp=temp.next;

       }
    }


    public void add(HeroNode heroNode2 ){
          HeroNode temp=head;
           while (true){
               if(temp.next==null){
                    break;
               }
              temp= temp.next;
           }
           temp.next=heroNode2;
           heroNode2.pre=temp;
    }


}

package com.pay.test;

public class DoubleLinkedListTest {
    public static void main(String[] args) {

        HeroNode heroNode1=new HeroNode(1,"張三","張三風");
        HeroNode heroNode2=new HeroNode(2,"李四","李四一");
        HeroNode heroNode3=new HeroNode(3,"王五","王老五");
        HeroNode heroNode4=new HeroNode(4,"趙六","趙老六");
        HeroNode heroNode5=new HeroNode(5,"劉七","劉老七");
        HeroNode heroNode6=new HeroNode(6,"王八","王老八");
        DoubleLinkedList list=new DoubleLinkedList();
        list.add(heroNode1);
        list.add(heroNode2);
        list.add(heroNode3);
        list.add(heroNode4);
        list.add(heroNode5);
        list.add(heroNode6);
        list.list();




    }

}