头插法翻转链表

/*
struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) :
            val(x), next(NULL) {
    }
};*/
class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {
        ListNode *tmp = pHead,*cur;
        ListNode *hnode = new ListNode(0);
        while(tmp){
            cur = tmp;
            tmp = tmp->next;
            cur->next = hnode->next;
            hnode->next = cur;
        }
        return hnode->next;
    }
};