20200331——剑指offer 面试题6：从头到尾打印链表

我用的是递归算法

package question6_print_link;

/**
 * @Classname Solution
 * @Description TODO
 * @Date 2020/3/31 15:06
 * @Created by mmz
 */
public class Solution {
    static class ListNode{
        int value;
        ListNode next = null;

        public ListNode(int value) {
            this.value = value;
        }
    }
    static void printListNode(ListNode head){
        if(head == null){
            return;
        }

        printListNode(head.next);
        System.out.println(head.value);

    }

    public static void main(String[] args) {
       ListNode head = new ListNode(4);
       ListNode one = new ListNode(5);
        ListNode two = new ListNode(6);
        head.next = one;
        one.next = two;
        printListNode(head);
    }

}

很简单的一个递归算法。

用栈也可以题解。

---

---

package question6_从尾到头打印链表;

import com.sun.corba.se.impl.dynamicany.DynValueBoxImpl;

/**
 * @Classname Mmz
 * @Description TODO
 * @Date 2020/7/18 14:33
 * @Created by mmz
 */
public class Mmz {
    static class ListNode{
        int value ;
        ListNode next = null;
        ListNode(int value){
            this.value = value;
        }
    }
    public static void Core(ListNode head){
        if(head == null){
            return ;
        }
        printList(head);
    }
    public static void printList(ListNode listNode){
        if(listNode == null){
            return;
        }
        printList(listNode.next);
        System.out.println(listNode.value);
    }
    public static void main(String[] args) {
        ListNode head = new ListNode(4);
        ListNode one = new ListNode(5);
        ListNode two = new ListNode(6);
        head.next = one;
        one.next = two;
        Core(head);
    }

}