链表的C++创建及翻转

以前感觉建立一个链表太简单不过了，但是当真正去实现的时候真让人奔溃。好不容易才实现，记录下来。
翻转就容易多了，记住不要吝惜定义指针，不要想着两个指针能不能实现，不要总想搞个大事情。

#include <iostream>
using namespace std;

struct node{
    int content;
    node *next;
};

node* ReverseList(node* phead) 
{
    node *pre = NULL, *cur = phead, *next = NULL;
    while (cur->next)
    {
        next = cur->next;
        cur->next = pre;
        pre = cur;
        cur = next;
    }
    cur->next = pre;
    return cur;
}

int main(void)
{
    node *p = new node(), *phead = p;
    for (int i = 0; i < 5; i++)
    {
        p->next = new node;
        p = p->next;
        p->content = i;
        p->next = NULL;
    }
    phead = phead->next;
    p = phead;
    while (p)
    {
        cout << p->content;
        p = p->next;
    }

    p = ReverseList(phead);
    cout <<endl<< "reverse" << endl;
    while (p)
    {
        cout << p->content;
        p = p->next;
    }
    return 0;
}