learn_code/C_DS_AIgo
learn_code/C_DS_AIgo
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

up queue

Browse Source
This commit is contained in:
Jdhggg 2025-04-17 09:38:24 +08:00
parent 8db20e924d
commit 41744c2cc3
3 changed files with 35 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
.gitignore vendored
View File

@ -52,3 +52,5 @@ Mkfile.old
dkms.conf
/.vs/Project2
/.vs
.vscode/settings.json
*.recipe

6
array_queue.c
View File

@ -50,7 +50,7 @@ void push_array_queue(array_queue *q, elem_type value)
if (full_array_queue(q))
{printf("error: queue is full[From push_queue]"); return;}
q->data[q->rear] = value;
q->rear = (q->front + q->size +1) % MAX_QUEUE;
q->rear = (q->front + q->size + 1) % MAX_QUEUE;
q->size++;
}
@ -73,11 +73,13 @@ void print_array_queue(array_queue *q)
printf("error :\n");
return ;
}
int j = q->front;
for (int i=0;i<q->size;i++)
{
printf("[");
printf("%d ",q->data[i%MAX_QUEUE]);
printf("%d ",q->data[j%MAX_QUEUE]);
printf("]\n");
j++;
}
}

45
main.c
View File

@ -1,7 +1,7 @@
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "linked_list.h"
#include "array_queue.h"
int main(void)
{
@ -46,21 +46,34 @@ int main(void)
push_array_queue(q, 666);
print_array_queue(q);*/
node* q1 = init_node(1);
node* q2 = init_node(2);
node* q3 = init_node(3);
node* q4 = init_node(4);
q1->next = q2;
q2->next = q3;
q3->next = q4;
//address_node *n = find_node(q1, 3);
// printf("%d\n %p\n", n->n,n->p
//int e = get_node_list(q1);
node* q2_3 = init_node(0);
insert_node(q2, q2_3);
print_node_list(q1);
delete_node(q2);
print_node_list(q1);
// node* q1 = init_node(1);
// node* q2 = init_node(2);
// node* q3 = init_node(3);
// node* q4 = init_node(4);
// q1->next = q2;
// q2->next = q3;
// q3->next = q4;
// //address_node *n = find_node(q1, 3);
// // printf("%d\n %p\n", n->n,n->p
// //int e = get_node_list(q1);
// node* q2_3 = init_node(0);
// insert_node(q2, q2_3);
// print_node_list(q1);
// delete_node(q2);
// print_node_list(q1);
array_queue *q = init_array_queue();
push_array_queue(q, 1);
push_array_queue(q, 2);
push_array_queue(q, 3);
print_array_queue(q);
printf("----------\n");
pop_array_queue(q);
print_array_queue(q);
printf("----------\n");
push_array_queue(q, 666);
print_array_queue(q);
printf("Hello World!\n");
system("pause");
return 0;