队列的基本操作
structComm.h//定义各种结构的头文件
让客户满意是我们工作的目标,不断超越客户的期望值来自于我们对这个行业的热爱。我们立志把好的技术通过有效、简单的方式提供给客户,将通过不懈努力成为客户在信息化领域值得信任、有价值的长期合作伙伴,公司提供的服务项目有:空间域名、网站空间、营销软件、网站建设、北辰网站维护、网站推广。
#ifndef STRUCTCOMM_H_INCLUDED #define STRUCTCOMM_H_INCLUDED #undef NULL #ifdef __cplusplus #define NULL 0 #else #define NULL ((void *)0) #endif struct list_head { struct list_head *next; struct list_head *prev; }; typedef struct tag_myTree { int data; struct tag_myTree* pLeft; struct tag_myTree* pRight; }myTree; typedef struct tag_myStack { int data; myTree *pTree; struct list_head stStack; }myStack; typedef struct tag_myQue { int data; myTree *pTree; struct list_head stQue; }myQue; #endif // STRUCTCOMM_H_INCLUDED
myQue.h
#ifndef MYQUE_H_INCLUDED #define MYQUE_H_INCLUDED #include "structComm.h" myQue* getNewNode(); void initQue(myQue *pRoot); void destoryQue(myQue *pRoot); int getQueLen(myQue *pRoot); int isQueEmpty(myQue *pRoot); void enQue(myQue *pRoot, myQue *pNew); myQue* deQue(myQue *pRoot); #endif // MYQUE_H_INCLUDED
myQue.c
#include "myQue.h" #include "myList.h" myQue* getNewQueNode() { myQue *pTmp = NULL; pTmp = (myQue *)malloc(sizeof(myQue)); if (NULL == pTmp) { return NULL; } pTmp->data = 0; pTmp->pTree = NULL; INIT_LIST_HEAD(&(pTmp->stQue)); return pTmp; } void initQue(myQue *pRoot) { pRoot->data = 0; pRoot->pTree = NULL; INIT_LIST_HEAD(&(pRoot->stQue)); return; } void destoryQue(myQue *pRoot) { struct list_head *pos = NULL; struct list_head *n = NULL; myQue *pstQue = NULL; list_for_each_safe(pos, n, &(pRoot->stQue)) { list_del(pos); pstQue = list_entry(pos, myQue, stQue); free(pstQue); pos = n; } return; } int getQueLen(myQue *pRoot) { int len = 0; struct list_head *pos = NULL; list_for_each(pos, &(pRoot->stQue)) { len++; } return len; } int isQueEmpty(myQue *pRoot) { return list_empty(&(pRoot->stQue)); } void enQue(myQue *pRoot, myQue *pNew) { list_add(&(pNew->stQue), &(pRoot->stQue)); } myQue* deQue(myQue *pRoot) { myQue *pstQue = NULL; struct list_head *pTmp = NULL; if (!isQueEmpty(pRoot)) { pTmp = (pRoot->stQue).prev; list_del((pRoot->stQue).prev); pstQue = list_entry(pTmp, myQue, stQue); return pstQue; } return NULL; }
main.c
#include#include "myQue.h" myQue g_stQueRoot; //栈的头节点,不存储数据 int main() { int i = 0; myQue *pNewNode = NULL; initQue(&g_stQueRoot); //初始化之前要保证头队列为空 printf("is empty:\t%d\n", isQueEmpty(&g_stQueRoot)); for (i = 0; i < 5; i++) { pNewNode = getNewNode(); if (NULL == pNewNode) { exit(0); } pNewNode->data = i; enQue(&g_stQueRoot, pNewNode); } printf("is empty:\t%d\n", isQueEmpty(&g_stQueRoot)); printf("que len:\t%d\n", getQueLen(&g_stQueRoot)); printf("de:\t"); for (i = 0; i < 5; i++) { pNewNode = deQue(&g_stQueRoot); printf("%d\t", pNewNode->data); } pNewNode = deQue(&g_stQueRoot); if (NULL == pNewNode) { printf("\ncan not de\n"); } return 0; }
当前名称:队列的基本操作
链接分享:http://myzitong.com/article/jppdjg.html