C语言队列写连连看心得

来源：互联网发布：开淘宝店考试答案编辑：程序博客网时间：2024/05/07 14:44

堆栈

类似于链表先进后出所以只需要操作头指针

队列

同样类似于链表从尾指针加入从头指针出所以需要两个

void InitQueue()//初始化队列{pqueue = (Queue*)malloc(sizeof(Queue));if(pqueue != NULL){pqueue->front=NULL;pqueue->rear=NULL;pqueue->size=0;}return;}PNode EnQueue(PNode pnode)//队列加入元素{if(pnode != NULL){pnode->next = NULL;if(IsEmpty()){pqueue->front = pnode;}else{pqueue->rear->next = pnode;}pqueue->rear=pnode;pqueue->size++;}return pnode;}PNode DeQueue()//删除元素{PNode pnode= pqueue->front;if(!IsEmpty()){pqueue->size--;pqueue->front = pnode->next;free(pnode);if(pqueue->size == 0)pqueue->rear = NULL;}return pqueue->front;}int IsEmpty()//判断是否为空{if(pqueue->rear == NULL && pqueue->size ==0){return 1;}else return 0;}void ClearQueue()//清空队列{PNode temp;PNode pnode= pqueue->front;while(IsEmpty() != 1){pqueue->size--;temp = pnode;//这里特别注意 先把要free的指针赋值出来 再free 不然容易引起空指针错误pnode = pnode->next;free(temp);if(pqueue->size == 0)pqueue->rear = NULL;}}

堆栈和队列同样有顺序储存结构类似于数组

做练练看的时候

int g_iMap[8][8];//管理精灵的地图int v[8][8];//管理精灵转折步骤的地图int g_iFirst[2]={-1,-1};int g_iState=0;int move[4][2]={{1,0},{0,1},{-1,0},{0,-1}};//移动方向 下右上左

关键是算法

int run(int a,int b, int c, int d){if(g_iMap[a][b] != g_iMap[c][d]  || (a==c && b==d)){return 0;}int i,x,y;if(!IsEmpty()){ClearQueue();//清空队列}for(i=0; i<4; i++){x =a + move[i][0];y =b + move[i][1];if(x<=-1 || y<=-1){continue;}if(x==c && y==d && g_iMap[a][b]==g_iMap[c][d]){g_iWin =1;return 1;}if(x<=7 && x>=0 && y<=7 && y>=0 && g_iMap[x][y]==-1){PNode pnode=(PNode)malloc(sizeof(Node));pnode->iPosX = x;pnode->iPosY = y;pnode->iStep = 0;pnode->next=NULL;pnode->iDirect = i;EnQueue(pnode);v[x][y] =0;}}while(!IsEmpty()){PNode node = pqueue->front;for(i=0; i<4; i++){x =node->iPosX + move[i][0];y =node->iPosY + move[i][1];if(x<=-1 || y<=-1){continue;}if(x==c && y==d ){if(node->iDirect != i && node->iStep >=2){continue;}g_iWin =1;return 1;}if(x<=7 && x>=0 && y<=7 && y>=0 && g_iMap[y][x] == -1){if(i == node->iDirect && (v[x][y] == -1 || v[x][y] >= node->iStep)){PNode pnode=(PNode)malloc(sizeof(Node));pnode->iPosX = x;pnode->iPosY = y;pnode->next=NULL;pnode->iStep=node->iStep;pnode->iDirect = i;EnQueue(pnode);v[x][y]=node->iStep;}else if(node->iStep<2 && (v[x][y] == -1 || v[x][y] >=node->iStep)){PNode pnode=(PNode)malloc(sizeof(Node));pnode->iPosX = x;pnode->iPosY = y;pnode->next=NULL;pnode->iStep=node->iStep+1;pnode->iDirect = i;EnQueue(pnode);v[x][y]=node->iStep+1;}}}DeQueue();}return 0 ;}

写代码的的时候注意先进行判断把不符合条件的直接返回

然后注意不越界还有空指针

0 0