思想参考:http://ceeji.net/blog/reserve-linked-list-cpp/
#include"list.h"
using namespace std;//非递归实现链表的反转,链表头结点要放元素
listnode* reverselist(listnode* head)
{
listnode* preversedhead=NULL;
listnode* pnode=head;
listnode* pprevous=NULL;
if(head==NULL)
return NULL;
while(pnode!=NULL)
{
listnode* pnext=pnode->next;
if(pnext==NULL)
preversedhead=pnode;
pnode->next=pprevous;