心得:对代码的格式有了更好地规范,在抄写代码的过程中慢慢培养了细心等品质,一个字符的出错都会使程序无法运行,感受到了代码编写的严谨性。对于链表的还未深刻理解,还得花功夫。.
链表的概念及结构
概念:链表是一种 物理存储结构上非连续 、非顺序的存储结构,数据元素的 逻辑顺序 是通过链表中的 指针链 接 次序实现的 。
原本我的1指向2,现在我中间插入一个5,我只需要将1指向的位置变成5,然后5的指针指向2:
#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.
*@paaram 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 % is beyond the scope of the list.",paraPosition);
return;
}// Of if
}// Of for i
//Step 2. Constuct 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 basicAddressTset(){
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