㈠ C語言里如何設置緩沖區
將數據以鏈表形式順序存放，新數據總是放在表尾，待處理的數據總是在頭結點下的第一個結點，處理完畢則釋放空間。x0dx0a x0dx0a#define BufferSize 1024 // 合適的大小你知道的x0dx0atypedef struct node {x0dx0a char *buffer;x0dx0a struct node *next;x0dx0a}*linkList;x0dx0a x0dx0aLinkList *InitList() {x0dx0a LinkList *head;x0dx0a head = (char *)malloc(size(node));x0dx0a head->next = NULL:x0dx0a return head;x0dx0a}x0dx0a x0dx0avoid AddData(LinkList *head, char *data) { // 將新數據添加到表尾x0dx0a LinkList *p = head;x0dx0a LinkList *anode = (char *)malloc(size(node));x0dx0a anode->buffer = (char *)malloc(size(BufferSize));x0dx0a strncpy(anode->buffer,data,BufferSize);x0dx0a anode->next = NULL:x0dx0a while(p->next) p = p->next;x0dx0a p->next = anode;x0dx0a}x0dx0a x0dx0avoid DealData(LinkList *head) {x0dx0a LinkList *p = head->next;x0dx0a if(p) {x0dx0a head->next = p->next;x0dx0a // p->buffer指向的數據待處理x0dx0a free(p->buffer); // 處理完畢，釋放空間x0dx0a free(p);x0dx0a }x0dx0a}