数据结构与算法单排日记-2020/3/5-链表之单链表-面试题

一.获取到单链表的节点的个数（如果是带头结点的链表，需求不统计头节点）

public class Demo01 {
    public static void main(String[] args) {
        Node one = new Node(1, "宋江", "及时雨");
        Node two = new Node(2, "卢俊义", "玉麒麟");
        Node three = new Node(3, "吴用", "智多星");
        Node four = new Node(4, "公孙胜", "入云龙");
        Node five = new Node(5, "关胜", "大刀");
        SingeLinkedList singeLinkedList = new SingeLinkedList();
        singeLinkedList.addByOrder(four);
        singeLinkedList.addByOrder(five);
        singeLinkedList.addByOrder(one);
        singeLinkedList.addByOrder(three);
        singeLinkedList.addByOrder(two);

        int a=count(singeLinkedList);
        System.out.println(a);
    }

    public static int count(SingeLinkedList singeLinkedList){
        Node temp = singeLinkedList.getFirstNode();
        int i = 0;
        if (temp.getNext()==null){
            System.out.println("链表为空");
            return 0;
        }else {
            while (true){
                if (temp.getNext()!=null){
                    i+=1;
                    temp=temp.getNext();
                }else {
                    break;
                }
            }
            return i;
        }
    }
}

2.查找单链表中的倒数第k个结点【新浪面试题】

public class Demo04 {
    public static void main(String[] args) {
        Node one = new Node(1, "宋江", "及时雨");
        Node two = new Node(2, "卢俊义", "玉麒麟");
        Node three = new Node(3, "吴用", "智多星");
        Node four = new Node(4, "公孙胜", "入云龙");
        Node five = new Node(5, "关胜", "大刀");
        SingeLinkedList singeLinkedList = new SingeLinkedList();
        singeLinkedList.addByOrder(four);
        singeLinkedList.addByOrder(five);
        singeLinkedList.addByOrder(one);
        singeLinkedList.addByOrder(three);
        singeLinkedList.addByOrder(two);

        Node k= search(1,singeLinkedList);
        System.out.println(k);
    }

/*思路：
    * 先使用一个节点temp01从头到尾遍历链表；
    * 再定义一个节点temp02,表示temp01之后的第k个节点,可以使用for循环实现
    * 直到，temp02为null时,说明temp02已经是最后一个节点的下一个节点，则temp01就是倒数第k个
    * */
    public static Node search(int k, SingeLinkedList singeLinkedList) {
        Node temp01 = singeLinkedList.getFirstNode();

        while (true) {
            Node temp02 = temp01;
            for (int i = 0; i < k; i++) {
                temp02 = temp02.getNext();
            }
            if (temp02==null){
                return temp01;
            }else {
                temp01=temp01.getNext();
            }
        }
    }
}

单链表的反转【腾讯面试题】

方法一，头插法

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Demo08 {
    public static void main(String[] args) {
        Node one = new Node(1, "宋江", "及时雨");
        Node two = new Node(2, "卢俊义", "玉麒麟");
        Node three = new Node(3, "吴用", "智多星");
        Node four = new Node(4, "公孙胜", "入云龙");
        Node five = new Node(5, "关胜", "大刀");
        SingeLinkedList singeLinkedList = new SingeLinkedList();
        SingeLinkedList reverse01 = new SingeLinkedList();

        List<Node> list = new ArrayList<>();

        Collections.addAll(list, one, two, three, four, five);
        list.stream().forEach(i -> singeLinkedList.add(i));//成功
        singeLinkedList.list();
        reverse(singeLinkedList);
    }

    public static void reverse(SingeLinkedList singeLinkedList) {
        Node head = singeLinkedList.getFirstNode();
        if (head.getNext() == null || head.getNext().getNext() == null) {
            return;
        } else {

            Node temp = head.getNext();//定义一个指针节点
            Node temp2 = null; //表示指针的下一个节点
            SingeLinkedList reverseSingleLinked = new SingeLinkedList();
            //遍历原来的链表
            //每遍历一个就插到翻转链表的头节点之后
            while (true) {
                if (temp == null) {
                    break;
                } else {
                    temp2 = temp.getNext();
                    temp.setNext(reverseSingleLinked.getFirstNode().getNext());//将当前temp节点之后挂上reverse头结点之后的节点
                    reverseSingleLinked.getFirstNode().setNext(temp);//再将组合好的节点挂到reverse的头结点之后
                    temp = temp2;//取下一个节点
                }
            }
            //将翻转的链表摘下挂会原来的链表的头结点之后
            singeLinkedList.getFirstNode().setNext(reverseSingleLinked.getFirstNode().getNext());
            singeLinkedList.list();
        }
    }
}

方法2：集合sort

不能直接使用List等集合存放原来链表的节点，因为这些节点已经通过原链表差生了相互联系，放在集合中的节点不是独立的，是相互联系的，如果把这种相互联系的节点放到新的链表中，这种相互联系会影响顺序，结果不正确，所以应该断开节点之间的联系，将取来的节点.setNext(null)，

import java.util.*;

public class Demo09 {
    public static void main(String[] args) {
        Node one = new Node(1, "宋江", "及时雨");
        Node two = new Node(2, "卢俊义", "玉麒麟");
        Node three = new Node(3, "吴用", "智多星");
        Node four = new Node(4, "公孙胜", "入云龙");
        Node five = new Node(5, "关胜", "大刀");
        SingeLinkedList singeLinkedList = new SingeLinkedList();
        SingeLinkedList reverse01 = new SingeLinkedList();

        List<Node> list = new ArrayList<>();

        Collections.addAll(list, one, two, three, four, five);
        list.stream().forEach(i -> singeLinkedList.add(i));//成功
        //singeLinkedList.list();
        reverse(singeLinkedList);
    }

    public static void reverse(SingeLinkedList singeLinkedList) {
        Node head = singeLinkedList.getFirstNode();
        if (head.getNext() == null || head.getNext().getNext() == null) {
            return;
        } else {

            Node temp = head.getNext();//定义一个指针节点

            SingeLinkedList reverseSingleLinked = new SingeLinkedList();
            //遍历原来的链表
            //每遍历一个就放到map集合
            int count = 0;
            ArrayList<Integer> list = new ArrayList<>();
            Map<Integer, Node> map = new HashMap<>();
            while (true) {
                if (temp == null) {
                    break;
                } else {
                    map.put(count, temp);
                    list.add(count);
                    count++;
                    temp = temp.getNext();
                }
            }
            //list集合排序
            Collections.sort(list, (a, b) -> {
                return b - a;
            });

            SingeLinkedList s = new SingeLinkedList();
			//根据新的list顺序取出map中的node节点
            for (Integer i : list) {
                map.get(i).setNext(null);//关键一步，断开节点之间的联系
                s.add(map.get(i));
            }
            s.list();
        }
    }
}