链表反转

`//==================

// Name : 链表反转.cpp
// Author : Gaotong
// Version :
// Copyright : www.acmerblog.com
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <stdio.h>
#include <stdlib.h>

/* 链表节点 /
struct node
{
int data;
struct node next;
};

/* 反转单链表. 分别用3个指针，指向前一个，当前，下一个 /
static void reverse(struct node* head_ref)
{
struct node* prev = NULL;
struct node* current = head_ref;
struct node next;
while (current != NULL)
{
next = current->next;
current->next = prev;
prev = current;
current = next;
}
*head_ref = prev;
}

/* 添加数据。 头部插入 /
void push(struct node* head_ref, int new_data)
{
struct node* new_node =
(struct node*) malloc(sizeof(struct node));

new_node->data  = new_data;
new_node->next = (*head_ref);
(*head_ref)    = new_node;

}

/* 打印链表 */
void printList(struct node *head)
{
struct node *temp = head;
while(temp != NULL)
{
printf("%d ", temp->data);
temp = temp->next;
}
}

int main()
{
struct node* head = NULL;

 push(&head, 20);
 push(&head, 4);
 push(&head, 15);
 push(&head, 85);
 push(&head, 60);
 push(&head, 100);

 printList(head);
 reverse(&head);
 printf("
 Reversed Linked list 
");
 printList(head);

}`