modify

32598045 · 宋海霞 · 8f305a80 · 32598045 · 32598045
--- a/SingleLinkList.h
+++ b/SingleLinkList.h
 #ifndef SINGLELINKLIST_H_
 #define SINGLELINKLIST_H_
 //
 // Include the C standard library header file here
 //
 #include <stdio.h>
 //
 // Other header files are included here
 //
 //
 // Define the data structure here
 //
 typedef int ElemType;	// The type of an element in a linked list
-typedef struct Node {
+typedef struct Node 
+{
 	ElemType data;		// Data fields
 	struct Node* next;	// pointer field
 }LinkList;
@@ -34,5 +30,4 @@ typedef struct Node {
 int InsertBefore(LinkList* pListHead, int i, ElemType Elem);
 #endif /* SINGLELINKLIST_H_ */
--- a/main.c
+++ b/main.c
 #include "SingleLinkList.h"
+#include <stdlib.h>
 int main(int argc, char* argv[])
 {
@@ -17,7 +17,7 @@ int main(int argc, char* argv[])
 	//
 	// Initializes the nodes of a single list
 	//
-	for(i=8; i>0; i--)
+	for (i=8; i>0; i--)
 	{
 		pListNode = (LinkList*)malloc(sizeof(LinkList));
 		pListNode->data = i;
@@ -33,7 +33,7 @@ int main(int argc, char* argv[])
 	InsertBefore(pListHead, 20, 15);	// Invalid insert position. Insert failed.
 	pListHeadTemp = pListHead;
-	while(pListHeadTemp->next != NULL)
+	while (pListHeadTemp->next != NULL)
 	{
 		pListNode = pListHeadTemp->next;
 		printf("%d ", pListNode->data);
@@ -44,7 +44,7 @@ int main(int argc, char* argv[])
 	//
 	// Destroy single linked list
 	//
-	while(pListHead->next != NULL)
+	while (pListHead->next != NULL)
 	{
 		pListNode = pListHead->next;
 		pListHead->next = pListNode->next;