单向链表面试题总结

https://blog.csdn.net/ibcve/article/details/79306668

 // 单向链表的创建和遍历，反转  查找单向链表中倒数第K个节点    判断两个单向链表相交的第一个节点
    static class IntLinked {
        int value;

        IntLinked(int value) {
            this.value = value;
        }

        IntLinked next;
    }

 private static void reverse() {
        IntLinked head = new IntLinked(0);
        IntLinked cur = head;
        for (int i = 1; i < 10; i++) {
            IntLinked next = new IntLinked(i);
            cur.next = next;
            cur = next;
        }

//        while (head != null) {
//            System.out.println(head.value);
//            head = head.next;
//        }

        IntLinked reverse = new IntLinked(head.value);
        IntLinked temp;
        while (head != null) {
            System.out.println(head.value);
            head = head.next;

            if (head != null) {
                temp = new IntLinked(head.value);
                temp.next = reverse;
                reverse = temp;
            }
        }
        System.out.println();

        while (reverse != null) {
            System.out.println(reverse.value);
            reverse = reverse.next;
        }
    }