fork download

copy

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
 
typedef struct Node
{
	char elem;
	struct Node *prev;
	struct Node *next;
}Node; // 노드 정의
 
typedef struct List
{
	struct Node *header;
	struct Node *trailer;
}List; // 리스트 정의
 
void init_list(List* list);
void add(List list, int r, char e);
void delete(List list, int r);
void get_entry(List list, int r);
void print(List list);
 
int main(void)
{
	List list; // 리스트 선언
 
	char op, item; // 입력 연산의 종류, 아이템
	int position; // 입력 위치
	int num_op; // 연산의 개수
 
	init_list(&list); // 리스트 초기화 (헤더, 트레일러 노드 할당 및 초기화)
 
	scanf("%d", &num_op); // 연산 개수 입력
 
	for (int i = 0; i < num_op; ++i)
	{
		getchar(); // 공백 또는 개행문자 읽기
		scanf("%c", &op); // 연산 종류
 
		switch (op)
		{
		case 'A': // 삽입
			scanf("%d %c", &position, &item);
			add(list, position, item);
			break;
		case 'D': // 삭제
			scanf("%d", &position);
			delete(list, position);
			break;
		case 'G': // 참조
			scanf("%d", &position);
			get_entry(list, position);
			break;
		case 'P': // 출력
			print(list);
			break;
		}
	}
 
	free(list); // 리스트의 노드 해제
 
	return 0;
}
 
void init_list(List* list)
{
	Node *H;
	Node *T;
	H = (Node*)malloc(sizeof(Node));
	T = (Node*)malloc(sizeof(Node));
 
	list->header = H;
	H->prev = NULL;
	H->next = T;
 
	list->trailer = T;
	T->prev = H;
	T->next = NULL;
}
 
void add(List list, int r, char e)
{
	Node *p;
	p = list.header;
 
	Node *newp = (Node*)malloc(sizeof(Node));
	newp->elem = e;
 
	int i;
	for(i=0; i<r ; i++)
	{
		p = p->next;
	}
	if(p->elem == ' ')
	{
		printf("invalid position\n");
		return;
	}
	newp->next = p;
	newp->prev = p->prev;
	p->prev = newp;
	newp->prev->next = newp;
}
 
void delete(List list, int r)
{
	Node *p;
	p = list.header;
 
	int i;
	for(i=0; i<r ; i++)
	{
		p = p->next;
	}
	if(p->elem == ' ')
	{
		printf("invalid position\n");
		return;
	}
	p->prev->next = p->next;
	p->next->prev = p->prev;
	free(p);
}
 
void get_entry(List list, int r)
{
	Node *p;
	p = list.header;
 
	int i;
	for(i=0; i<r ; i++)
	{
		p = p->next;
	}
	if(p->elem == ' ')
	{
		printf("invalid position\n");
		return;
	}
	printf("%c\n", p->elem);
}
 
void print(List list)
{
	Node *p;
	p = list.header;
 
	while(p->elem != NULL)
	{
		p = p->next;
		printf("%c", p->elem);
	}
	printf("\n");
}

prog.c: In function ‘main’:
prog.c:62:7: error: incompatible type for argument 1 of ‘free’
  free(list); // 리스트의 노드 해제
       ^~~~
In file included from prog.c:4:
/usr/include/stdlib.h:563:25: note: expected ‘void *’ but argument is of type ‘List’ {aka ‘struct List’}
 extern void free (void *__ptr) __THROW;
                   ~~~~~~^~~~~
prog.c: In function ‘print’:
prog.c:150:16: warning: comparison between pointer and integer
  while(p->elem != NULL)
                ^~
prog.c: In function ‘main’:
prog.c:35:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &num_op); // 연산 개수 입력
  ^~~~~~~~~~~~~~~~~~~~
prog.c:40:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%c", &op); // 연산 종류
   ^~~~~~~~~~~~~~~~
prog.c:45:4: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %c", &position, &item);
    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
prog.c:49:4: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &position);
    ^~~~~~~~~~~~~~~~~~~~~~
prog.c:53:4: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &position);
    ^~~~~~~~~~~~~~~~~~~~~~

Standard output is empty