链表的反转

链表的反转，采用头插法

链表程序如下：

#pragma  once
#include "stdlib.h"
#include<iostream>

using namespace std;

typedef struct sNode
{

int data;

sNode *next;

}Node;

void InitList();
void ReverseList();

#include "ReverseList.h"

int data[] = {1,2,3,4,5,6,7,8,9};
Node* head = NULL;


void InsertList()
{

if (!head)return;

for (int i = 0; i < sizeof(data)/sizeof(int);i++)

{

Node *temp = (Node*)malloc(sizeof(Node));

temp->data = data