#include <stdio.h>
#include <stdlib.h>
typedef int DataType;//給int起個(gè)別名，方便以后修改
typedef struct Node
{
	DataType data;//數(shù)據(jù)域
	struct Node *next;//指針域
}SLNode;
//初始化
void ListInit(SLNode **head)
{
	*head = (SLNode *)malloc(sizeof(SLNode));//申請(qǐng)頭結(jié)點(diǎn)
	(*head)->next = NULL;
}
//求當(dāng)前數(shù)據(jù)元素個(gè)數(shù)
int ListLength(SLNode *head)
{
	SLNode *p = head;
	int size = 0;
	while (p->next != NULL)
	{
		p = p->next;
		size++;
	}
	return size;
}
//插入
int ListInsert(SLNode *head, int i, DataType x)
{
	SLNode *p, *q;
	int j;
	p = head;
	j = -1;
	while (p->next != NULL && j < i - 1)
	{
		p = p->next;
		j++;
	}
	if (j != i - 1)
	{
		printf("插入?yún)?shù)位置錯(cuò)誤！??！\n");
		return 0;
	}
	q = (SLNode *)malloc(sizeof(SLNode));//生成新結(jié)點(diǎn)
	q->data = x;
	q->next = p->next;
	p->next = q;
	return 1;
}
//刪除
int ListDelete(SLNode *head, int i, DataType *x)
{
	SLNode *p, *q;
	int j;
	p = head;
	j = -1;
	while (p->next != NULL && p->next->next != NULL && j < i - 1)
	{
		p = p->next;
		j++;
	}
	if (j != i - 1)
	{
		printf("刪除位置參數(shù)錯(cuò)誤?。?！\n");
		return 0;
	}
	q = p->next;
	*x = q->data;
	p->next = p->next->next;
	free(q);//釋放被刪除結(jié)點(diǎn)的內(nèi)存空間
	return 1;
}
//按位取
int ListGet(SLNode *head, int i, DataType *x)
{
	SLNode *p;
	int j;
	p = head;
	j = -1;
	while (p->next != NULL && j < i)
	{
		p = p->next;
		j++;
	}
	if (j != i)
	{
		printf("取出位置參數(shù)錯(cuò)誤?。?！\n");
		return 0;
	}
	*x = p->data;
	return 1;
}
//釋放
void ListDestroy(SLNode **head)
{
	SLNode *p, *q;
	p = *head;
	while (p != NULL)
	{
		q = p;
		p = p->next;
		free(q);
	}
	*head = NULL;
}

int main()
{
	SLNode *head;
	int i, x;
	ListInit(&head);
	for (i = 0; i < 10; i++)
		ListInsert(head, i, i + 10);
	ListDelete(head, 9, &x);
	for (i = 0; i < ListLength(head); i++)
	{
		ListGet(head, i, &x);
		printf("%d ", x);
	}
	ListDestroy(&head);
	system("pause");
	return 0;
}