문제05-2 더미 노드 기반 양방향 연결 리스트

	#include <stdio.h>
	#include <stdlib.h>
	#pragma warning(disable:4996)
	typedef struct _node
	{
	int data;
	struct _node * next;
	struct _node * prev;
	}Node;
	typedef struct _link
	{
	Node * head;
	Node * tail;
	Node * cur;
	int numOfdata;
	}List;
	void ListInit(List *plist)
	{
	plist->head = (Node*)malloc(sizeof(Node));
	plist->tail = (Node*)malloc(sizeof(Node));
	plist->head->next = plist->tail;
	plist->head->prev = NULL;
	plist->tail->prev = plist->head;
	plist->tail->next = NULL;
	plist->numOfdata = 0;
	}
	void LInsert(List *plist, int data)
	{
	Node * newnode = (Node*)malloc(sizeof(Node));
	newnode->data = data;
	plist->tail->prev->next = newnode;
	newnode->prev = plist->tail->prev;
	newnode->next = plist->tail;
	plist->tail->prev = newnode;
	(plist->numOfdata)++;
	}
	int LFirst(List *plist, int* data)
	{
	if (plist->head->next == plist->tail)
	return 0;
	plist->cur = plist->head->next;
	*data = plist->cur->data;
	return 1;
	}
	int LNext(List *plist, int *data)
	{
	if (plist->cur->next == plist->tail)
	return 0;
	plist->cur = plist->cur->next;
	*data = plist->cur->data;
	return 1;
	}
	int LRemove(List *plist)
	{
	Node * rnode = plist->cur;
	int rdata = rnode->data;
	plist->cur->prev->next = plist->cur->next;
	plist->cur->next->prev = plist->cur->prev;
	plist->cur = plist->cur->prev;
	free(rnode);
	(plist->numOfdata)--;
	return rdata;
	}
	int main()
	{
	List list;
	int data;
	ListInit(&list);
	//저장
	LInsert(&list, 1);
	LInsert(&list, 2);
	LInsert(&list, 3);
	LInsert(&list, 4);
	//조회
	if (LFirst(&list, &data))
	{
	printf("%d ", data);
	while (LNext(&list, &data))
	printf("%d ", data);
	printf("\n");
	}
	//2의 배수 삭제
	if (LFirst(&list, &data))
	{
	if (data % 2 == 0)
	LRemove(&list);
	while (LNext(&list, &data))
	{
	if (data % 2 == 0)
	LRemove(&list);
	}
	}
	//조회
	if (LFirst(&list, &data))
	{
	printf("%d ", data);
	while (LNext(&list, &data))
	printf("%d ", data);
	printf("\n");
	}
	return 0;
	}

view raw .c hosted with ❤ by GitHub