静态链表(作业三)

创建节点

typedef struct StaticLinkedNode{
	char data;
 
	int next;
} *NodePtr;
 
typedef struct StaticLinkedList{
	NodePtr nodes;
	int* used;
} *ListPtr;
 

表头

 
ListPtr initLinkedList() 
{	
	ListPtr tempPtr = (ListPtr)malloc(sizeof(StaticLinkedList));	
	tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);
	tempPtr->used = (int *)malloc(sizeof(int) * DEFAULT_SIZE);
	tempPtr->nodes[0].data = '\0';
	tempPtr->nodes[0].next = -1;
	tempPtr->used[0] = 1;
	for (int i = 1; i < DEFAULT_SIZE; i ++) 
    {
		tempPtr->used[i] = 0;
	}
	return tempPtr;
}
 

打印链表

void printList(ListPtr paraListPtr){
	int p = 0;
	while (p != -1) {
		printf("%c", paraListPtr->nodes[p].data);
		p = paraListPtr->nodes[p].next;
	}// Of while
	printf("\r\n");
}

插入节点

ListPtr initLinkedList(){
	
	ListPtr tempPtr = (ListPtr)malloc(sizeof(struct StaticLinkedList));
 
	
	tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);
	tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);
 
	
	tempPtr->nodes[0].data = '\0';
	tempPtr->nodes[0].next = -1;
 
	
	tempPtr->used[0] = 1;
	int i; 
	for (i = 1; i < DEFAULT_SIZE; i ++){
		tempPtr->used[i] = 0;
	}
 
	return tempPtr;
}

删除节点

void deleteElement(ListPtr paraListPtr, char paraChar){
	int p, q;
	p = 0;
	while ((paraListPtr->nodes[p].next != -1) && (paraListPtr->nodes[paraListPtr->nodes[p].next].data != paraChar)){
		p = paraListPtr->nodes[p].next;
	}
 
	if (paraListPtr->nodes[p].next == -1) {
		printf("Cannot delete %c\r\n", paraChar);
		return;
	}
 
	q = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
	
	
	paraListPtr->used[q] = 0;
}

测试

 
void appendInsertDeleteTest() 
{	
	ListPtr tempList = initLinkedList();	
	printList(tempList);
	
	insertElement(tempList, 'H', 0);	
	insertElement(tempList, 'e', 1);
	insertElement(tempList, 'l', 2);	
	insertElement(tempList, 'l', 3);	
	insertElement(tempList, 'o', 4);	
	printList(tempList);
 
	
	printf("Deleting 'e'.\r\n");
	deleteElement(tempList, 'e');
	printf("Deleting 'a'.\r\n");
	
	deleteElement(tempList, 'a');
	printf("Deleting 'o'.\r\n");
	
	deleteElement(tempList, 'o');
	printList(tempList);
 
	insertElement(tempList, 'x', 1);
	printList(tempList);
}
int main() 
{
	appendInsertDeleteTest();
}
 

加油,冲冲冲

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值