线性表链式存储_api函数实现

传智课程学习笔记。

代码,大概敲得,可能有小错误,

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "linklist.h"

typedef struct _tag_LinkList
{
	LinkListNode header;
	int length;
}TLinkList;

LinkList* LinkList_Create()
{
	TLinkList* ret = NULL;
	ret = (TLinkList *)malloc( sizeof( TLinkList));
	memset( ret, 0, sizeof( TLinkList));
	ret->length = 0;
	ret->header.next = NULL;
	return ret;
}

void LinkList_Destroy( LinkList* list)
{
	if( list !=NULL )
	{
		free( list);
		list = NULL;
	}
	return ;
}
void LinkList_Clear( LinkList* list)
{
	TLinkList* tList = NULL;
	if( list == NULL)
	{
		return ;
	}
	tList = (TLinkList *)list;

	tList->length = 0;
	tList->header.next = NULL;
	return;
}

int LinkList_Length( LinkList* list)
{
	TlinkList *tList = NULL;
	if( list == NULL )
	{
		return ;
	}
	tList = ( TLinkList *)list;
	return this->length;
}



int LinkList_Insert( LinkList* list, LinkListNode* node, int pos)
{
	int ret = 0;
	LinkLitsNode *current = NULL;
	TLinkList *tList = NULL;
	if( list == NULL || node == NULL || pos<0)
	{
		ret = 0; 
		printf("func LinkList_inserterr:%d\n", ret );
		return ret;
	}
	tList = ( TLinkList *)list;
	current = &(tList->header);

	for( i=0; i<pos && current->next!=NULL; i++ )
	{
		current = current->next;
	}

	node->next = current->next;
	current->next = node;
	tList->length++;
	return 0;
}

LinkListNode* LinkList_Get( LinkList* list, int pos)
{
	int ret = 0, i=0;
	LinkListNode *current = NULL;

	TLinkList *tList = NULL;
	if( list == NULL || node==NULL | pos<0)
	{
		ret = 0;
		printf("func err:%d\n", ret);
		return NULL;
	}
	tList = ( TLinkList)list;
	current = &( tList->header);

	for( i=0; i<pos&&( current->next!=NULL); i++)
	{
		current = current->next;
	}

	return current->next;
}

LinkListNode* LinkList_Delete( LinkList* list, int pos)
{
	int ret = 0, i=0;
	LinkListNode* current = NULL;

	TLinkList *tList = NULL;

	if( list == NULL || pos<0)
	{
		ret = 0;
		printf("func linklist_insert9) err:%d\n", ret);
		return NULL;
	}
	tList = (TLinkList)list;
	current = &(tList->header);

	for( i=0; i<pos&&(current->next!=NULL; i++)
	{
		current = current->next;
	}
	ret = current->next;

	current->next = ret->next;
	
	return ret;
}