單向不帶頭鏈表的使用

鏈表的創(chuàng)建：

typedef struct LNode {
	SLDataType data;
	struct LNode* next;
}LNode,*LinkList;

按位查找

LNode* GetElem(LinkList L, int i) {
	int j = 1;
	LNode* p = L->next;
	if (i < 0)
		return NULL;
	if (i == 0)
		return L;
	while (p && j < i) {
		p = p->next;
		j++;
	}
	return p;
}

后插（將值為x的元素插入到第i個(gè)位置）

p=GetElen(L,i-1);
s->next=p->next;
p->next=s;

?前插操作

s->next=p->next;
p->next=s;
tmp=p->data;
p->data=s->data;
s->data=tmp;

?

?

按值查找

LNode* LocateElem(LinkList l, SLDataType e) {
	LNode* p = l->next;
	while (p && p->data != e) {
		p = p->next;
	}
	return p;
}

畫圖時(shí)應(yīng)先畫物理結(jié)構(gòu)圖在畫邏輯結(jié)構(gòu)圖

鏈表的頭插

//尾插
void SListPushBack(SLTNode** pphead, SLDataType x);

void SListPushBack(SLTNode** pphead, SLDataType x) {

	SLTNode* newnode = BuySListNode(x);
	
	if (*pphead == NULL) {
		*pphead = newnode;
	}
	else {
		//找尾結(jié)點(diǎn)的指針
		SLTNode* tail = *pphead;
		while (tail->next) {
			tail = tail->next;
		}
		//將尾結(jié)點(diǎn)鏈接到新的結(jié)點(diǎn)
		tail->next = newnode;
	}
}

鏈表的尾插

void SListPushFront(SLTNode** pphead, SLDataType x) {
	SLTNode* newnode = BuySListNode(x);
	newnode->next = *pphead;
	*pphead = newnode;
}

?鏈表的頭刪

//頭刪
void SListPopFront(SLTNode** pphead);

void SListPopFront(SLTNode** pphead)
{
	SLTNode* next = (*pphead)->next;
	free(*pphead);
	*pphead = next;
}

鏈表的尾刪

//尾刪
void SListPopBack(SLTNode** pphead);

void SListPopBack(SLTNode** pphead)
{
	//鏈表為空
	if (*pphead = NULL) {
		return;
	}
	//只有一個(gè)結(jié)點(diǎn)
	else if (*pphead) {
		free(*pphead);
		*pphead = NULL;
	}
	else {
		SLTNode* prev = NULL;
		SLTNode* tail = *pphead;
		while (tail->next) {
			prev = tail;
			tail = tail->next;
		}
		free(tail);
		prev->next = NULL;
	}
	
}

?鏈表的結(jié)點(diǎn)查找

SLTNode* SListFind(SLTNode* phead, SLDataType x);

SLTNode* SListFind(SLTNode* phead, SLDataType x)
{
	SLTNode* cur=phead;
	while (cur) {
		if (cur->data == x) {
             return cur;
		}
        cur = cur->next;
	}
	return NULL;
}

結(jié)點(diǎn)的創(chuàng)建

SLTNode* BuySListNode(SLDataType x) {
	SLTNode* newnode = (SLTNode*)malloc(sizeof(SLTNode));
	newnode->data = x;
	newnode->next = NULL;
	return newnode;
}

在pos的前面插入x?

//在pos的前面插入x
void SListInsert(SLTNode** pphead,SLTNode* pos, SLDataType x);

void SListInsert(SLTNode** pphead, SLTNode* pos, SLDataType x) {
	if (pos == *pphead) {
		SListPushFront(pphead, x);
	}
	else {
		SLTNode* newnode = BuySListNode(x);
		SLTNode* prev = *pphead;
		while (prev->next != pos) {
			prev = prev->next;
		}
		prev->next = newnode;
		newnode->next = pos;
	}
}

刪除pos位置的值

void SListErase(SLTNode** pphead, SLTNode* pos) {
	if (pos = *pphead) {
		SListPopFront(pphead);
	}
	else {
		SLTNode* prev = *pphead;
		while (prev->next != pos) {
			prev = prev->next;
		}
		prev->next = pos->next;
		free(pos);
	}
	
}

文章來源地址http://www.zghlxwxcb.cn/news/detail-808029.html

到了這里，關(guān)于單向不帶頭鏈表的使用的文章就介紹完了。如果您還想了解更多內(nèi)容，請?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章，希望大家以后多多支持TOY模板網(wǎng)！