算法-单链表反转｜默然的博客

头插反转法

static Node nodeReverse(Node head)
{
    if (head == null || head.next == null) return head;
    Node new_head = null;

    while (head != null)
    {
        Node temp = head;
        head = head.next;
        temp.next = new_head;
        new_head = temp;
    }

    return new_head;
}

就地逆置法

static Node nodeReverse(Node head)
{
    if (head == null || head.next == null) return head;
    Node begin = head;
    Node end = head.next;

    while (end != null)
    {
        begin.next = end.next;
        end.next = head;
        head = end;
        end = begin.next;
    }

    return head;
}

反转链表中的部分数据

相关阅读

• 分治算法解决问题再回顾
• 算法-从第一个元素开始，计算累和的最大值