算法--倒序打印链表--java

最新推荐文章于 2021-12-21 14:43:42 发布

吃水煮鱼片

最新推荐文章于 2021-12-21 14:43:42 发布

阅读量323

点赞数

分类专栏：算法-面试

本文链接：https://blog.csdn.net/weixin_29135773/article/details/58327124

版权

算法-面试专栏收录该内容

5 篇文章 0 订阅

订阅专栏

使用栈来实现

static class Node{
        int data;
        Node next;
        public Node(int data, Node next) {
            this.data = data;
            this.next = next;
        }
        @Override
        public String toString() {
            return "Node{" + "data=" + data + '}';
        }
    }

    public static void main(String[] args) {
        Node node3 = new Node(3, null);
        Node node2 = new Node(2, node3);
        Node node1 = new Node(1, node2);
        print(node1);
    }

    private static void print(Node node) {
        Node head = new Node(0, node);
        Stack<Node> stack = new Stack<>();
        while(head.next != null){
            stack.push(head.next);
            head = head.next;
        }
        while(!stack.isEmpty()){
            System.out.println(stack.pop());
        }
    }

使用递归来实现

    static class Node{
        int data;
        Node next;
        public Node(int data, Node next) {
            this.data = data;
            this.next = next;
        }
        @Override
        public String toString() {
            return "Node{" + "data=" + data + '}';
        }
    }

    public static void main(String[] args) {
        Node node3 = new Node(3, null);
        Node node2 = new Node(2, node3);
        Node node1 = new Node(1, node2);
        print(node1);
    }

    private static void print(Node node) {
        if(node == null){
            return ;
        }
        if(node.next != null){
            print(node.next);
        }
        System.out.println(node);
    }