单链表反转

单链表的3中反转方式,附带简单测试。

源码

package suanfa.lianbiao;

import java.util.Stack;

public class ReverseListTest {

    public static void main(String[] args) {
        Node node1 = new Node(1, null);
        Node node2 = new Node(2, node1);
        Node node3 = new Node(3, node2);
        Node node4 = new Node(4, node3);
        Node node5 = new Node(5, node4);
        Node node = node5;
        out(node);
        node = reverseList1(node);
        out(node);
        node = reverseList2(node);
        out(node);
        node = reverseList3(node);
        out(node);
    }


    public static Node reverseList1(Node head) {
        Node node = null;
        while (head != null) {
            Node next = head.next;
            head.next = node;
            node = head;
            head = next;
        }
        return node;
    }

    public static Node reverseList2(Node head) {
        if (head == null || head.next == null) {
            return head;
        }

        Node next = head.next;
        head.next = null;
        Node node = reverseList2(next);
        next.next = head;
        return node;
    }

    public static Node reverseList3(Node head) {
        if (head == null) {
            return head;
        }
        Stack<Node> stack = new Stack<>();
        while (head != null) {
            stack.add(head);
            Node next = head.next;
            head.next = null;
            head = next;
        }
        Node node = stack.pop();
        head = node;
        while (!stack.isEmpty()) {
            head.next = stack.pop();
            head = head.next;
        }
        return node;
    }

    private static void out(Node head) {
        Node cur = head;
        while (cur != null) {
            System.out.print(cur.value + "    ");
            cur = cur.next;
        }
        System.out.println();
    }

    public static class Node {
        public int value;
        public Node next;

        public Node(int value, Node next) {
            this.value = value;
            this.next = next;
        }
    }
}
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值