反转单链表

struct Node{
	int data;
	struct Node *next;
};

Node* ReverseList(Node *head){
	Node *pre, *cur, *next;
	if(head == NULL || head->next == NULL)
		return head;
	cur = head->next;
	pre = head;
	pre->next = NULL;
	while(cur){
		next = cur->next;
		cur->next = pre;
		pre = cur;
		cur = next;
	}
	return pre;
}

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if(head == NULL || head->next == NULL)
            return head;
        ListNode *pre = NULL, *next = NULL;
        while(head){
            next = head->next;
            head->next = pre;
            pre = head;
            head = next;
        }
        return pre;
    }
};

递归反转单链表

//递归方式  
ListNode * ReverseList2(ListNode * head)  
{  
    //如果链表为空或者链表中只有一个元素  
    if(head==NULL || head->m_pNext==NULL)  
        return head;  
    else  
    {  
       ListNode * newhead=ReverseList2(head->m_pNext);//先反转后面的链表  
       head->m_pNext->m_pNext=head;//再将当前节点设置为其然来后面节点的后续节点  
       head->m_pNext=NULL;  
       return newhead;  
    }  
}