剑指Offer-5

来源：互联网发布：mac 终端查看当前目录编辑：程序博客网时间：2024/06/08 18:07

题目：

输入一个链表的头节点，从头到尾反过来打印出每个节点的值。

实现

//coding = javaimport java.util.Stack;public class Solution5 {    //    public static void printListReversinglyUsingStack(Node head){        if(head==null){            return;        }        Stack<Node> stack = new Stack();        while(head!=null){            stack.push(head);            head = head.next;        }        while (!stack.isEmpty()){            System.out.print(stack.pop().value+" ");        }    }    //递归实现    public static void printListInverselyUsingRecursion(Node head) {        if (head == null) {            return;        }        printListInverselyUsingRecursion(head.next);        System.out.print(head.value + " ");    }    public static void main(String[] args){        Node head = new Node(5);        head.next = new Node(4);        head.next.next = new Node(3);        head.next.next.next = new Node(2);        head.next.next.next.next = new Node(1);        System.out.println("通过栈 实现");        Solution5.printListReversinglyUsingStack(head);        System.out.print("\n");        System.out.println("通过递归实现");        Solution5.printListInverselyUsingRecursion(head);    }}class Node {    int value;    Node next;    public Node(int value){        this.value=value;    }    public Node(){    }}

阅读全文

1 0