#include<stdio.h>

#include<iostream>

#define null (0)

struct node

};

//! 链表倒序

node* reverse(node** listPointer)

{

if(null == listPointer || null == *listPointer) return null;

node* list = *listPointer;

node* prev = null;

node* next = null;

while(null != list)

{

next = list->next;

list->next = prev;

prev = list;

list = next;

}

*listPointer = prev;

return prev;

}

void insert_tail(node* list, int val)

}

void printList(node* list)

}

int main()

}