单链表作业

#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 lsit 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. Consruct a 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 /5d 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 on 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 text.
 */
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

#include <stdio.h>
#include <stdlib.h>

typedef struct LNode
{
    ElemType data;
    struct LNode *next;
} LNode, *LinkList; //单链表的储存结构

int main()
{
    CJYNode*p;
    LinkList L=NULL;
    int length, i, j, k, m, n;
    i = 9;
    j = 5;
    k = 2;
    n = 10;
    L = CreateList1();
    L = CreateList2();
    length = ListLength(L);
    printf("单链表长度为：%d\n",length);
    
    p = GetList(L,k);
    printf("位置查找第%d个位置的元素是：%d\n",k,p->data);
    
    m = LocateElem(L,j);
    printf("数值查找为%d的位置是%d\n",j,m);
    
    ListInsert(L,i,j);
    ListDelete(L,i);
}

Status InitList(LinkList &L)
{
    L = new LNode;
    L->next = NULL;
    return OK;
} //单链表的初始化

Status GetElem(LinkList L,int i,ElemType &e)
{
    p = L->next;
    j = 1;
    while(p&&j<i)
    {
        p=p->next;
        ++j;
    }
    if(!p||j>i)
    return ERROR;
    e=p->data;
    return OK;
} //单链表的取值

LNOde *LocateElem(LinkList L,ElemType e
{
    p=L->next;
    while(p&&p->data!=e)
    {
        p=p->next;
    }
    return p;
} //单链表的按值查找

Status ListInsert(LinkList &L,int i,ElemType e)
{
    p=L;
    j=0;
    while(p&&(j,i-1))
    {
        p=p->next;
        ++j;
    }
    if(!p||j>i-1)
    return ERROR;
    a=new LNOde;
    s->data=e;
    s->next=p->next;
    p->next=s;
    return OK;
} //单链表的插入
Status ListDelete(LinkList &L,int i)
{
    p=L;
    j=0;
    while((p->next)&&(j<i-1))
    {
        p=p->next;
        ++j;
    }
    if(!(p->next)||(j>i-1))
    return ERROR;
    q=p->next;
    p->next=q->next;
    delete q;
    return OK;
} //单链表的删除

void CreateList_H(LinkList &L,int n)
{
    L=new LNode;
    L->next=NULL;
    for(i=0; i<n; ++i)
    {
        p=new LNode;
        cin>>p->data;
        p->next=L->next;
        L->next=p;
    }
} //前插法创建单链表

了解了链表的优点离散的小空间分配方便，改变容量方便。缺点不可随机存取，存储密度低。