数据结构与算法-单链表的常见面试题（单链表的长度，单链表倒数第k个数据）

---

求单链表中节点的个数

在上一节代码的基础上我们来学习

思路分析

1. 我们创建的链表为有头节点的链表，我们不可以计算它的头节点；
2. 找到头节点，去遍历其一共有多少个节点；
3. 要排除链表为空的情况。
   代码演示：

    //get singleLinkedList's node number(not head node)
    public static int getLength(HeroNode head){
        if (head.next == null){
            System.out.println("The LinkList is Empty");
            return 0;
        }
        int length = 0;
        //定义一个辅助变量
        HeroNode cur = head.next;
        while(cur != null){
            length++;
            cur = cur.next;
        }
        return length;
    }

在main方法中加入

   //Test LinkedList length
   System.out.println(getLength(singleLinkedList.getHead()));

运行

完整代码

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.addByOrder(hero1);
        singleLinkedList.addByOrder(hero4);
        singleLinkedList.addByOrder(hero2);
        singleLinkedList.addByOrder(hero3);


        //显示一把
        singleLinkedList.list();
        //Test LinkedList length
        System.out.println(getLength(singleLinkedList.getHead()));

    }

    //get singleLinkedList's node number(not head node)
    public static int getLength(HeroNode head){
        if (head.next == null){
            System.out.println("The LinkList is Empty");
            return 0;
        }
        int length = 0;
        //定义一个辅助变量
        HeroNode cur = head.next;
        while(cur != null){
            length++;
            cur = cur.next;
        }
        return length;
    }

}

//定义SingleLinkedList管理我们的英雄
class SingleLinkedList{
    //初始化一个头节点,不存放具体数据
    private HeroNode head = new HeroNode(0,"","");

    public HeroNode getHead() {
        return head;
    }



    //不考虑顺序，找到链表的最后节点，将最后的next指向新的节点
    public void addHero(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){  //说明我的heroNode应该插入到这个temp的后面
                break;
            }else if (temp.next.no == heroNode.no){
                flag = true;
                break;
            }
            temp = temp.next; //后移
        }
        //判断flag的值
        if (flag){
            System.out.printf("准备插入的英雄%d已经有了\n",heroNode.no);
        }else {
            //插入数据
            heroNode.next = temp.next;
            temp.next = heroNode;
        }
    }


    //显示链表
    public void list(){
        if(head.next == null){
            System.out.println("链表为空");
            return;
        }

        HeroNode tmp = head.next;
        while (true){
            if(tmp.next == null){
                System.out.println(tmp);
                break;
            }
            System.out.println(tmp);
            tmp = tmp.next;
        }
    }
}

class HeroNode{
    public int no;
    public String name;
    public String nickName;
    public HeroNode next; //指向下一个节点
    //构造器
    public HeroNode(int hNo,String hName,String hNickName) {
        this.no = hNo;
        this.name = hName;
        this.nickName = hNickName;
    }
    //重写toString
    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                ", nickName='" + nickName + '\'' +
                '}';
    }


}

查找单链表中倒数第k个节点

思路如下：

1.编写一个方法，接受head节点
2.同时接收index, index指的是倒数第index个节点
3.先把链表从头到尾遍历，得到链表的总长度
4.我们遍历size - index个,如果找到就返回该节点，负责返回空

编写找倒数第k个节点的方法

    //Sina Interview Questions
    public static HeroNode findLastNode(HeroNode head, int k){
        if(  head.next == null){
            System.out.println("linkedList is Empty");
            return null;
        }
        int length = getLength(head);
        if(k<=0 || k> length){
            System.out.println("The input number is not right");
            return null;
        }
        //Define an auxiliary variable
        HeroNode cur = head.next;
        for (int i = 0; i < length - k; i++) {
            cur = cur.next;
        }
        return cur;
    }

在main方法中调用

    HeroNode lastNode = findLastNode(singleLinkedList.getHead(), 2);
    System.out.println(lastNode);

运行结果（倒数第2个）

全量代码

package com.chad.lambda;

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.addByOrder(hero1);
        singleLinkedList.addByOrder(hero4);
        singleLinkedList.addByOrder(hero2);
        singleLinkedList.addByOrder(hero3);


        //显示一把
        singleLinkedList.list();
        //Test LinkedList length
        System.out.println(getLength(singleLinkedList.getHead()));
        HeroNode lastNode = findLastNode(singleLinkedList.getHead(), 2);
        System.out.println(lastNode);


    }

    //Sina Interview Questions
    public static HeroNode findLastNode(HeroNode head, int k){
        if(  head.next == null){
            System.out.println("linkedList is Empty");
            return null;
        }
        int length = getLength(head);
        if(k<=0 || k> length){
            System.out.println("The input number is not right");
            return null;
        }
        //Define an auxiliary variable
        HeroNode cur = head.next;
        for (int i = 0; i < length - k; i++) {
            cur = cur.next;
        }
        return cur;
    }

    //get singleLinkedList's node number(not head node)
    public static int getLength(HeroNode head){
        if (head.next == null){
            System.out.println("The LinkList is Empty");
            return 0;
        }
        int length = 0;
        //定义一个辅助变量
        HeroNode cur = head.next;
        while(cur != null){
            length++;
            cur = cur.next;
        }
        return length;
    }

}

//定义SingleLinkedList管理我们的英雄
class SingleLinkedList{
    //初始化一个头节点,不存放具体数据
    private HeroNode head = new HeroNode(0,"","");

    public HeroNode getHead() {
        return head;
    }



    //不考虑顺序，找到链表的最后节点，将最后的next指向新的节点
    public void addHero(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){  //说明我的heroNode应该插入到这个temp的后面
                break;
            }else if (temp.next.no == heroNode.no){
                flag = true;
                break;
            }
            temp = temp.next; //后移
        }
        //判断flag的值
        if (flag){
            System.out.printf("准备插入的英雄%d已经有了\n",heroNode.no);
        }else {
            //插入数据
            heroNode.next = temp.next;
            temp.next = heroNode;
        }
    }


    //显示链表
    public void list(){
        if(head.next == null){
            System.out.println("链表为空");
            return;
        }

        HeroNode tmp = head.next;
        while (true){
            if(tmp.next == null){
                System.out.println(tmp);
                break;
            }
            System.out.println(tmp);
            tmp = tmp.next;
        }
    }
}

class HeroNode{
    public int no;
    public String name;
    public String nickName;
    public HeroNode next; //指向下一个节点
    //构造器
    public HeroNode(int hNo,String hName,String hNickName) {
        this.no = hNo;
        this.name = hName;
        this.nickName = hNickName;
    }
    //重写toString
    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                ", nickName='" + nickName + '\'' +
                '}';
    }


}