c 鏈表

來源:互聯網
上載者:User

介面標頭檔

/* * linklist.h * *  Created on: 2012-11-11 *      Author: inner */#ifndef LINKLIST_H_#define LINKLIST_H_#include <stdbool.h>#define SIZE 30//struct film{//char title[SIZE];//int rating;//};//typedef struct film Item;typedef int Elem;typedef struct node{Elem elem;struct node *next;} Node;typedef Node *linkList;/*初始化鏈表*/void InitializeList(linkList *list);/* 添加節點*/void addNodeList(linkList *list,Elem elem);/*擷取節點數量*/int getListCount(linkList *list);#endif /* LINKLIST_H_ */
實現源檔案
/* * link.c * *  Created on: 2012-11-11 *      Author: inner */#include<stdio.h>#include <stdlib.h>#include"linklist.h"void InitializeList(linkList *list){*list = NULL;}void addNodeList(linkList *list, int elem){Node *p;//下一節點Node *list1 = *list;p =(Node *)malloc(sizeof(Node));p->elem = elem;p->next = NULL;/*判斷頭結點是否空*/if(list1 == NULL){       *list= p;}else{while(list1->next != NULL)  list1  = list1->next;list1->next = p;}}int getListCount(linkList *list){int count = 0;Node *node = *list;while(node->next!=NULL){++count;node = node->next;}return count;}

就寫這麼多了有時間再更新

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.