数据结构第三次课

#include <stdio.h>
#include <malloc.h>

/**
 * Linked list of characters. The key is data.字符链表
 */
typedef struct LinkNode 
{
	char data;
	struct LinkNode* next;
} LNode, * LinkList, * NodePtr;

/**
 * Initialize the list with a header.初始化头结点
 * @return The pointer to the header.
 */
LinkList initLinkList() 
{
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->data = '\0';
	tempHeader->next = NULL;
	return tempHeader;
}// Of initLinkList

/**
 * Print the list.打印链表
 * @param paraHeader The header of the list.
 */
void printList(NodePtr paraHeader) 
{
	NodePtr p = paraHeader->next;
	while (p != NULL) 
	{
		printf("%c", p->data);
		p = p->next;
	}// Of while
	printf("\r\n");
}// Of printList

/**
 * Add an element to the tail.加到尾部
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 */
void appendElement(NodePtr paraHeader, char paraChar) 
{
	NodePtr p, q;

	// Step 1. Construct a new node.建立一个新结点
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	q->next = NULL;

	// Step 2. Search to the tail.找到最后一个结点
	p = paraHeader;
	while (p->next != NULL) 
	{
		p = p->next;
	}// Of while

	// Step 3. Now add/link.
	p->next = q;
}// Of appendElement

/**
 * Insert an element to the given position.插入
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 * @param paraPosition The given position.
 */
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition) 
{
	NodePtr p, q;

	// Step 1. Search to the position.
	p = paraHeader;
	for (int i = 0; i < paraPosition; i++) 
	{
		p = p->next;
		if (p == NULL) 
		{
			printf("The position %d is beyond the scope of the list.", paraPosition);
			return;
		}// Of if
	} // Of for i

	// Step 2. Construct a new node.
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;

	// Step 3. Now link.
	printf("linking\r\n");
	q->next = p->next;
	p->next = q;
}// Of insertElement

/**
 * Delete an element from the list.删除
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 */
void deleteElement(NodePtr paraHeader, char paraChar) 
{
	NodePtr p, q;
	p = paraHeader;
	while ((p->next != NULL) && (p->next->data != paraChar)) 
	{
		p = p->next;
	}// Of while

	if (p->next == NULL) {
		printf("Cannot delete %c\r\n", paraChar);
		return;
	}// Of if没有删除元素

	q = p->next;
	p->next = p->next->next;
	free(q);
}// Of deleteElement

/**
 * Unit test.
 */
void appendInsertDeleteTest() {
	// Step 1. Initialize an empty list.
	LinkList tempList = initLinkList();
	printList(tempList);

	// Step 2. Add some characters.
	appendElement(tempList, 'H');
	appendElement(tempList, 'e');
	appendElement(tempList, 'l');
	appendElement(tempList, 'l');
	appendElement(tempList, 'o');
	appendElement(tempList, '!');
	printList(tempList);

	// Step 3. Delete some characters (the first occurrence).
	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printList(tempList);

	// Step 4. Insert to a given position.
	insertElement(tempList, 'o', 1);
	printList(tempList);
}// Of appendInsertDeleteTest

/**
 * Address test: beyond the book.
 */
void basicAddressTest() {
	LNode tempNode1, tempNode2;

	tempNode1.data = 4;
	tempNode1.next = NULL;

	tempNode2.data = 6;
	tempNode2.next = NULL;

	printf("The first node: %d, %d, %d\r\n",
		&tempNode1, &tempNode1.data, &tempNode1.next);
	printf("The second node: %d, %d, %d\r\n",
		&tempNode2, &tempNode2.data, &tempNode2.next);

	tempNode1.next = &tempNode2;
}// Of basicAddressTest

/**
 * The entrance.
 */
int main() {
	appendInsertDeleteTest();
}// Of main

这篇代码的前半部分已大致理解，但 address test部分还有问题待解决

本节课学了单链表的初始化、插入和删除，其逻辑也大致理解，但对malloc还有点陌生，或许我应该去学习C++。

另外 书中有关结构指针描述单链表的内容

//单链表的存储结构
typedef struct LNote
{
  ElemType data;     //结点的数据域
  struct LNode *next;//结点的指针域
}LNode,*LinkList;    //LinkList为指向结构体LNode的指针类型

 对弈这段内容的第二点的最后一句也不太懂，应该要复习一下结构体了