华赛面试总结：单链表逆序

面试时间：2011.09.09

面试失败原因：基础知识掌握不牢固

面试题目一：单链表逆序

正确程序如下：

/************************************************************************/
/* 
时间：20011.09.09
对单链表进行逆序，注意是无头结点链表
华赛面试总结
                                                         */
/************************************************************************/


#include "stdio.h"
#include "stdlib.h"
#include "assert.h"
typedef char ElemType;

typedef struct  tagNode
{
	ElemType data;
	struct tagNode *next;

}Node, *List;


//创建新链表
List  CreateList()
{
	ElemType ch;
	List newlist = NULL;
	Node *p = NULL, *q = NULL;
	newlist = (Node*)malloc(sizeof(Node));
    assert(newlist != NULL);
	printf("请输入字符创建新链表，以回车键结束。\n");
	if ((ch = getchar()) != '\n')
	{
		newlist->data = ch;
	}
	
	newlist ->next = NULL;

	p = newlist;

	while((ch = getchar()) != '\n')
	{
		q = (Node*)malloc(sizeof(Node));
		assert(q != NULL);
		q->data = ch;
		q->next = p->next;
		p->next = q;
		p = q;
	}

	return newlist;
}

//输出链表
void  outputList(List list)
{   
	Node *p;
	assert(list != NULL);
	p = list;
	printf(" \n");
	while(p)
	{
		printf("%c—>",p->data);
        p = p->next;
	}
	printf("NULL\n");
}

//无头结点链表逆序，返回逆序后第一个结点
Node *ReverseList(Node *head)
{
	Node* p = NULL, *q = head->next;
	head->next = NULL;

	//遍历链表，依次将结点插入第一个结点前面
	while(q != NULL)
	{
		p = q;
		q = q->next;
		p->next = head;
		head = p;
	}
	return head;
}

int main()
{   
	List mylist;
	printf("创建新链表：\n");
    mylist = CreateList();
	printf("您创建的链表为:\n");
	outputList(mylist);
	printf("逆序的链表为:\n");
	outputList(ReverseList(mylist));
	return 0;
}