数据结构与算法之单链表面试题

单链表面试题

1、求单链表的有效节点的个数

 //求单链表的有效节点的个数
    public int getlength(HeroNode node){
        int length=0;
        HeroNode cur=node.next;
        while (cur!=null){
            length++;
            cur=cur.next;
        }
        return length;
    }

2、查找单链表中有效节点的个数

//查找单链表中的倒数第k个结点
    public HeroNode getIndex(HeroNode node,int index){
       HeroNode cur=node.next;
       int length=0;
       while (cur!=null){
           length++;
           cur=cur.next;
       }
       HeroNode temp=node.next;
       for (int i=0;i<length-index;i++){
           temp=temp.next;
       }
       return temp;
    }

3、单链表的反转

//单链表的反转
    public void singlyLinklistFangzhuang(HeroNode node){

       if (node.next==null||node.next.next==null){
           return;
       }
       HeroNode cur=node.next;
       HeroNode next=null;
       HeroNode res=new HeroNode(0,"","");
       while(cur.next!=null){
           next=cur.next;
           cur.next=res.next;
           res.next=cur;
           cur=next;
       }
       node.next=res.next;

    }

4、从头到尾打印单链表

/从尾到头打印单链表，要求采用Stack栈
    public void singlyLinkedListStack(HeroNode node){
       if (node.next==null){
           return ;
       }
        Stack<Object> stack = new Stack<>();
        HeroNode cur=node.next;
        while (cur!=null){
            stack.push(cur);
            cur=cur.next;
        }
        while (stack.size()>0){
            System.out.println(stack.pop());
        }
    }

全部代码

public class singLyLinkedListMiansiDemo {
    public static void main(String[] args) {
        HeroNode heroNode1 = new HeroNode(1, "宋江", "及时雨");
        HeroNode heroNode2 = new HeroNode(2, "卢俊义", "玉麒麟");
        HeroNode heroNode3 = new HeroNode(9, "吴用", "智多星");
        HeroNode heroNode4 = new HeroNode(4, "林冲", "豹子头");
        HeroNode heroNode5 = new HeroNode(11, "林冲", "豹子头");
        SingleLinkedList sll = new SingleLinkedList();
        sll.addNode(heroNode1);
        sll.addNode(heroNode2);
        sll.addNode(heroNode3);
        sll.addNode(heroNode4);
        sll.addNode(heroNode5);
        sll.showList();
        System.out.println(sll.getlength(sll.getHead()));
        System.out.println(sll.getIndex(sll.getHead(),2));
        sll.singlyLinklistFangzhuang(sll.getHead());
        sll.showList();
        sll.singlyLinkedListStack(sll.getHead());
    }
}


class SingleLinkedList{
   HeroNode head=new HeroNode(0,"","");
   public HeroNode getHead(){
        return head;
    }
    //1、无序添加节点
    public void addNode(HeroNode node){
      HeroNode temp=head;
        while (true){
            if (temp.next==null){
                break;
            }
            temp=temp.next;
        }
        temp.next=node;

    }
    //2、有序添加节点
    public void addNodeOrder(HeroNode node){
        HeroNode temp=head;
        boolean flag=false;
        while (true){
            //如果元素为空，直接插入
            if (temp.next==null){
                break;
            }
            else if (temp.next.no>node.no){
                break;
            }else if (temp.next.no==node.no){//节点已经存在
                flag=true;
                break;

            }
            temp=temp.next;
        }
        if (flag){
            System.out.println(node.no+"节点已经存在");
        }else {
            node.next=temp.next;
            temp.next=node;

        }
    }
    //删除节点
    public void  del(int no){
       HeroNode temp=head;
        boolean flag=true;
        while (true){
            if (temp.next==null){
                break;
            }else if (temp.next.no==no){
                flag=false;
                break;
            }
            temp=temp.next;
        }
        if (!flag){
            temp.next=temp.next.next;
        }else {
            System.out.println("没有找到要删除的编号");
        }

    }
    //修改节点
    public void update(HeroNode newnode){
        HeroNode temp=head.next;
        boolean flag=true;
        while (true){
            if (temp==null){
                System.out.println("链表为空");
                break;
            }else if (temp.next.no==newnode.no){
                flag=false;
                break;
            }
            temp=temp.next;
        }
        if (!flag){
            temp.name=newnode.name;
            temp.nickname=newnode.nickname;
        }

    }
    //展示链表
    public void showList(){
       HeroNode temp=head.next;
        if (head.next==null){
            System.out.println("链表为空");
        }
        while(true){
            if (temp==null){
                break;
            }
            System.out.println(temp);
            temp=temp.next;
        }
    }


    //求单链表的有效节点的个数
    public int getlength(HeroNode node){
        int length=0;
        HeroNode cur=node.next;
        while (cur!=null){
            length++;
            cur=cur.next;
        }
        return length;
    }

    //查找单链表中的倒数第k个结点
    public HeroNode getIndex(HeroNode node,int index){
       HeroNode cur=node.next;
       int length=0;
       while (cur!=null){
           length++;
           cur=cur.next;
       }
       HeroNode temp=node.next;
       for (int i=0;i<length-index;i++){
           temp=temp.next;
       }
       return temp;
    }
    //单链表的反转
    public void singlyLinklistFangzhuang(HeroNode node){

       if (node.next==null||node.next.next==null){
           return;
       }
       HeroNode cur=node.next;
       HeroNode next=null;
       HeroNode res=new HeroNode(0,"","");
       while(cur.next!=null){
           next=cur.next;
           cur.next=res.next;
           res.next=cur;
           cur=next;
       }
       node.next=res.next;

    }
    //从尾到头打印单链表，要求采用Stack栈
    public void singlyLinkedListStack(HeroNode node){
       if (node.next==null){
           return ;
       }
        Stack<Object> stack = new Stack<>();
        HeroNode cur=node.next;
        while (cur!=null){
            stack.push(cur);
            cur=cur.next;
        }
        while (stack.size()>0){
            System.out.println(stack.pop());
        }
    }




}

class HeroNode{
    public int no;
    public String name;
    public String nickname;
    public HeroNode next;
    public HeroNode(){

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