Linkedlist를 이용하여 List에 데이터를 넣었다가 빼고, 리스트에 존재하는지 등에 대한 Function들을 작성해보았습니다.
(비교, ArrayList 사용하기 : http://jwprogramming.tistory.com/228 )
(1) linkedlistmain.c
#include <stdio.h>
#include <stdlib.h>
#include "linkedlist.h"
int main(int argc, char* argv[]) {
int i = 0;
int arrayCount = 0;
LinkedList * pList = NULL;
ListNode * pNode = NULL;
ListNode node;
pList = createLinkedList();
if (pList != NULL) {
node.data = 1;
addLLElement(pList, 0, node);
node.data = 3;
addLLElement(pList, 1, node);
node.data = 5;
addLLElement(pList, 2, node);
displayLinkedList(pList);
removeLLElement(pList, 0);
displayLinkedList(pList);
deleteLinkedList(pList);
}
return 0;
}
(2) linkedlist.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "linkedlist.h"
LinkedList* createLinkedList() {
LinkedList *pReturn = NULL;
int i = 0;
pReturn = (LinkedList *)malloc(sizeof(LinkedList));
if (pReturn != NULL) {
memset(pReturn, 0, sizeof(LinkedList));
}
else {
printf("오류, 메모리할당 createLinkedList() \n");
return NULL;
}
return pReturn;
}
int addLLElement(LinkedList* pList, int position, ListNode element) {
int ret = FALSE;
int i = 0;
ListNode* pPreNode = NULL;
ListNode* pNewNode = NULL;
if (pList != NULL) {
if (position >= 0 && position <= pList->currentElementCount) {
pNewNode = (ListNode*)malloc(sizeof(ListNode));
if (pNewNode != NULL) {
*pNewNode = element;
pNewNode->pLink = NULL;
pPreNode = &(pList->headerNode);
for (i = 0; i < position; i++) {
pPreNode = pPreNode->pLink;
}
pNewNode->pLink = pPreNode->pLink;
pPreNode->pLink = pNewNode;
pList->currentElementCount++;
ret = TRUE;
}
else {
printf("오류, 메모리할당 addLLElement() \n");
return ret;
}
}
else {
printf("오류, 위치 인덱스-[%d], addLLElement() \n", position);
}
}
return ret;
}
int removeLLElement(LinkedList* pList, int position) {
int ret = FALSE;
int i = 0;
int arrayCount = 0;
ListNode* pNode = NULL;
ListNode* pDelNode = NULL;
if (pList != NULL) {
arrayCount = getLinkedListLength(pList);
if (position >= 0 && position < arrayCount) {
pNode = &(pList->headerNode);
for (i = 0; i < position; i++) {
pNode = pNode->pLink;
}
pDelNode = pNode->pLink;
pNode->pLink = pDelNode->pLink;
free(pDelNode);
pList->currentElementCount--;
ret = TRUE;
}
else {
printf("오류, 위치 인덱스-[%d] removeLLElement() \n", position);
}
}
return ret;
}
ListNode* getLLElement(LinkedList* pList, int position) {
ListNode* pReturn = NULL;
int i = 0;
ListNode* pNode = NULL;
if (pList != NULL) {
if (position >= 0 && position < pList->currentElementCount) {
pNode = &(pList->headerNode);
for (i = 0; i <= position; i++) {
pNode = pNode->pLink;
}
pReturn = pNode;
}
}
return pReturn;
}
void deleteLinkedList(LinkedList* pList) {
int i = 0;
if (pList != NULL) {
clearLinkedList(pList);
free(pList);
}
}
void clearLinkedList(LinkedList* pList) {
if (pList != NULL) {
if (pList->currentElementCount > 0) {
removeLLElement(pList, 0);
}
}
}
int getLinkedListLength(LinkedList* pList) {
int ret = 0;
if (pList != NULL) {
ret = pList->currentElementCount;
}
return ret;
}
int isEmpty(LinkedList* pList) {
int ret = FALSE;
if (pList != NULL) {
if (pList->currentElementCount == 0) {
ret = TRUE;
}
}
return ret;
}
void displayLinkedList(LinkedList* pList) {
int i = 0;
if (pList != NULL) {
printf("현재 원소 개수 : %d\n", pList->currentElementCount);
for (i = 0; i < pList->currentElementCount; i++) {
printf("[%d], %d\n", i, getLLElement(pList, i)->data);
}
}
else {
printf("원소가 없습니다.\n");
}
}
(3) linkedlist.h
#ifndef _LINKEDLIST_
#define _LINKEDLIST_
typedef struct ListNodeType
{
int data;
struct ListNodeType* pLink;
} ListNode;
typedef struct LinkedListType
{
int currentElementCount;
ListNode headerNode;
} LinkedList;
void displayLinkedList(LinkedList* pList);
LinkedList* createLinkedList();
int addLLElement(LinkedList* pList, int position, ListNode element);
int removeLLElement(LinkedList* pList, int position);
ListNode* getLLElement(LinkedList* pList, int position);
void deleteLinkedList(LinkedList* pList);
void clearLinkedList(LinkedList* pList);
int getLinkedListLength(LinkedList* pList);
int isEmpty(LinkedList* pList);
void displayLinkedList(LinkedList* pList);
#endif
#ifndef _COMMON_LIST_DEF_
#define _COMMON_LIST_DEF_
#define TRUE 1
#define FALSE 0
#endif
'Programming > C' 카테고리의 다른 글
| (5) DoubleLinkedList 사용하기 (0) | 2016.10.30 |
|---|---|
| (4) Linkedlist 를 이용하여 Reverse, Concat 응용 (0) | 2016.10.30 |
| (2) ArrayStack 사용하기 (0) | 2016.10.30 |
| (1) ArrayList 사용하기 (0) | 2016.10.30 |
| C언어란? (0) | 2016.04.18 |
WRITTEN BY
