【剑指OFFER】反转链表

题目描述

输入一个链表，反转链表后，输出新链表的表头。

算法思路

用两个指针current和previous。current遍历链表，previous指向current在反转前链表中的前一个结点。将current和previous的next指针反转，当current->next = nullptr时，该节点为反转链表的头节点。

C++代码

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {
        ListNode *reverseHead, *current, *previous;
        reverseHead = nullptr;
        current = (ListNode*) malloc(sizeof(ListNode));
        previous = nullptr;
        current = pHead;
        while(current != NULL){
            ListNode *n = current->next;
            current->next = previous;
            if(n == nullptr)
                reverseHead = current;
            previous = current;
            current = n;
        }
        return reverseHead;
    }
};