链表试题算法汇总

1链表基本操作typedef struct myLink{int data;struct myLink *next;//创建链表包含头节点int creatLink(Link **phead){int res = 0;int num;Link *ptm = (Link *)malloc(sizeof(Link));ptm->data = 0;*phead = ptm;printf("请输入数据，以0结束！！！\n");scanf("%d", &num);while (num != 0){Link *pNew = (Link *)malloc(sizeof(Link));if (pNew == NULL){res = -1;printf("pNew==NULL 创建链表失败error:%d\n",res);}pNew->data = num;ptm->next = pNew;ptm = pNew;printf("请输入数据，以0结束！！！\n");scanf("%d", &num);}ptm->next = NULL;return res;}//打印链表int printLink(Link *pHead){int res = 0;Link *p = pHead->next;if (p == NULL){res = -1;printf("printfLink() err:%d 链表为空打印失败\n",res);return res;}while (p != NULL){printf("data=%d\n",p->data);p = p->next;}return res;}//插入链表在data=x的前面插入data=y;int insertLink(Link *pHead, int x, int y){int res = 0;if (pHead == NULL){res = -1;printf("pHead==NULL insertLink() err:%d\n",res);return res;}Link *pNew = (Link *)malloc(sizeof(Link));pNew->data = y;Link *pPre = pHead;Link *pCurr = pHead->next;int flag = 0;while (pCurr != NULL){if (pCurr->data == x){flag = 1;break;}pPre = pPre->next;pCurr = pCurr->next;}if (flag == 0){res = -2;printf("原链表中没有%d\n",x);return res;}pNew->next = pCurr;pPre->next = pNew;return res;}//删除链表中节点删除data=x的节点int deleLink(Link *pHead, int x){int res = 0;if (pHead == NULL){res = -1;printf("pHead==NULL deleLink() error:%d\n",res);return res;}Link *pPre = pHead;Link *pCurr = pHead->next;int flag = 0;while (pCurr != NULL){if (pCurr->data == x){flag = 1;break;}pPre = pPre->next;pCurr = pCurr->next;}if (flag == 0){res = -2;printf("原链表中没有%d\n", x);return res;}pPre->next = pCurr->next;return res;}//反转链表int revertLink(Link *pHead){int res = 0;if (pHead == NULL||pHead->next==NULL||pHead->next->next==NULL) {res = -1;printf("pHead==NULL revertLink() error:%d\n",res);return res;}Link *pPre = pHead->next;Link *pCurr = pHead->next->next;Link *q = NULL;while (pCurr != NULL){q = pCurr->next;pCurr->next = pPre;pPre = pCurr;pCurr = q;}pHead->next->next = NULL;pHead->next = pPre;return res;}//链表排序//再创建一个空链表从原链表中找到最大值的那个节点然后往空链表里添加int sortLink(Link *pHead,Link **pHead1){int res = 0;Link *pNewHead = (Link *)malloc(sizeof(Link));pNewHead->data = 0;Link *pNewTail = pNewHead;if (pHead == NULL){res = -1;printf("pHead==NULL sortLink() erro:%d\n", res);return res;}//先从原链表里找出最大值的那个节点start:{Link *pMax = pHead->next;Link *pPre = pHead;Link *pCurr = pMax->next;while (pCurr != NULL){if (pCurr->data > pMax->data){pPre = pMax;pMax = pCurr;}pCurr = pCurr->next;}pPre->next = pMax->next;// 让最大的那个节点脱离原链表if (pNewHead->next == NULL){pNewHead->next = pMax;pNewTail = pMax;pMax->next = NULL;}else{pNewTail->next = pMax;pNewTail = pMax;pMax->next = NULL;}if (pHead->next == NULL) //所有的节点都脱离了原链表{goto sortEnd;}goto start;}sortEnd:*pHead1 = pNewHead;return res;}int destoryLink(Link **pHead){int res = 0;if (pHead == NULL){res = -1;printf("pHead==NULL 链表为空释放内存失败erro:%d\n",res);return res;}Link *pt = *pHead;while (pt != NULL){Link *tmp = pt->next;free(pt);pt =tmp;}*pHead = NULL;return res;}//测试案例void main(){Link *pHead = NULL;int res;res = creatLink(&pHead);if (res != 0){printf("function creatLink() err:%d\n",res);goto End;}res = printLink(pHead);if (res != 0){printf("function printLink() err:%d\n", res);goto End;}printf("**************** 在3的前面插入4 **************************\n");res = insertLink(pHead,3,4);if (res != 0){printf("function insetrLink() err:%d\n", res);goto End;}res = printLink(pHead);if (res != 0){printf("function printLink() err:%d\n", res);goto End;}printf("**************** 删除data=4的节点**************************\n");res = deleLink(pHead,4);if (res != 0){printf("function deleLink() err:%d\n", res);goto End;}res = printLink(pHead);if (res != 0){printf("function printLink() err:%d\n", res);goto End;}printf("**************** 逆转链表**************************\n");res = revertLink(pHead);if (res != 0){printf("function revertLink() err:%d\n", res);goto End;}res = printLink(pHead);if (res != 0){printf("function printLink() err:%d\n", res);goto End;}printf("**************** 从大到小排序链表**************************\n");Link *pHead1 = NULL;res = sortLink(pHead,&pHead1);if (res != 0){printf("function sortLink() err:%d\n", res);goto End;}res = printLink(pHead1);if (res != 0){printf("function printLink() err:%d\n", res);goto End;}End:if (pHead != NULL){res = destoryLink(&pHead);if (res != 0){printf("function destoryLink() is error:%d\n",res);return;}}system("pause");}2、单链表的建立，把‘a’--‘z’26个字母插入到链表中，并且倒叙，还要打印#include <stdio.h>#include <stdlib.h>typedef struct val{char data;struct val *next;}node,*p;void main(void){node *p = NULL;node *q = NULL;node *head = (node *)malloc(sizeof(node));head->data = ' ';head->next = NULL;node *first = (node *)malloc(sizeof(node));first->data = 'a';first->next = NULL;head->next = first;p = first;int longth = 'z' - 'b';int i = 0;while (i <= longth){node *temp = (node *)malloc(sizeof(node));temp->data = 'b'+i;temp->data = NULL;//开始逆转q = temp;head->next = temp;temp->next = p;p = q;i++;}//打印链表node *tmp = head->next;while (tmp!= NULL){printf("data:%c ",tmp->data);tmp = tmp->next;}}3约瑟夫问题循环链表.h文件#ifndef _CIRCLELIST_H_#define _CIRCLELIST_H_typedef void CircleList;/*typedef struct _tag_CircleListNode CircleListNode;struct _tag_CircleListNode{CircleListNode* next;};*/typedef struct _tag_CircleListNode{struct _tag_CircleListNode * next;}CircleListNode;CircleList* CircleList_Create();void CircleList_Destroy(CircleList* list);void CircleList_Clear(CircleList* list);int CircleList_Length(CircleList* list);int CircleList_Insert(CircleList* list, CircleListNode* node, int pos); CircleListNode* CircleList_Get(CircleList* list, int pos);CircleListNode* CircleList_Delete(CircleList* list, int pos);//addCircleListNode* CircleList_DeleteNode(CircleList* list, CircleListNode* node); CircleListNode* CircleList_Reset(CircleList* list);CircleListNode* CircleList_Current(CircleList* list);CircleListNode* CircleList_Next(CircleList* list);#endifC. 文件#include <stdio.h>#include <malloc.h>#include "circleList.h"typedef struct _tag_CircleList{CircleListNode header;CircleListNode* slider;int length;} TCircleList;CircleList* CircleList_Create() // O(1){TCircleList* ret = (TCircleList*)malloc(sizeof(TCircleList));if (ret == NULL){return NULL;}ret->length = 0;ret->header.next = NULL;ret->slider = NULL;return ret;}void CircleList_Destroy(CircleList* list) // O(1){if (list == NULL){return ;}free(list);}void CircleList_Clear(CircleList* list) // O(1){TCircleList* sList = (TCircleList*)list;if (sList == NULL){return ;}sList->length = 0;sList->header.next = NULL;sList->slider = NULL;}int CircleList_Length(CircleList* list) // O(1){TCircleList* sList = (TCircleList*)list;int ret = -1;if (list == NULL){return ret;}ret = sList->length;return ret;}int CircleList_Insert(CircleList* list, CircleListNode* node, int pos) // O(n) {int ret = 0, i=0;TCircleList* sList = (TCircleList*)list;if (list == NULL || node== NULL || pos<0){return -1;}//if( ret ){CircleListNode* current = (CircleListNode*)sList;for(i=0; (i<pos) && (current->next != NULL); i++){current = current->next;}//current->next 0号节点的地址node->next = current->next; //1current->next = node; //2//若第一次插入节点if( sList->length == 0 ){sList->slider = node;}sList->length++;//若头插法if( current == (CircleListNode*)sList ){//获取最后一个元素CircleListNode* last = CircleList_Get(sList, sList->length - 1);last->next = current->next; //3}}return ret;}CircleListNode* CircleList_Get(CircleList* list, int pos) // O(n){TCircleList* sList = (TCircleList*)list;CircleListNode* ret = NULL;int i = 0;if (list==NULL || pos<0){return NULL;}//if( (sList != NULL) && (pos >= 0) && (sList->length > 0) ){CircleListNode* current = (CircleListNode*)sList;for(i=0; i<pos; i++){current = current->next;}ret = current->next;}return ret;}CircleListNode* CircleList_Delete(CircleList* list, int pos) // O(n){TCircleList* sList = (TCircleList*)list;CircleListNode* ret = NULL;int i = 0;if( (sList != NULL) && (pos >= 0) && (sList->length > 0) ){CircleListNode* current = (CircleListNode*)sList;CircleListNode* last = NULL;for(i=0; i<pos; i++){current = current->next;}//若删除第一个元素if( current == (CircleListNode*)sList ){last = (CircleListNode*)CircleList_Get(sList, sList->length - 1);}//求要删除的元素ret = current->next;current->next = ret->next;sList->length--;//判断链表是否为空if( last != NULL ){sList->header.next = ret->next;last->next = ret->next;}//若删除的元素为游标所指的元素if( sList->slider == ret ){sList->slider = ret->next;}//若删除元素后，链表长度为0if( sList->length == 0 ){sList->header.next = NULL;sList->slider = NULL;}}return ret;}CircleListNode* CircleList_DeleteNode(CircleList* list, CircleListNode* node) // O(n) {TCircleList* sList = (TCircleList*)list;CircleListNode* ret = NULL;int i = 0;if( sList != NULL ){CircleListNode* current = (CircleListNode*)sList;//查找node在循环链表中的位置ifor(i=0; i<sList->length; i++){if( current->next == node ){ret = current->next;break;}current = current->next;}//如果ret找到，根据i去删除if( ret != NULL ){CircleList_Delete(sList, i);}}return ret;}CircleListNode* CircleList_Reset(CircleList* list) // O(1) {TCircleList* sList = (TCircleList*)list;CircleListNode* ret = NULL;if( sList != NULL ){sList->slider = sList->header.next;ret = sList->slider;}return ret;}CircleListNode* CircleList_Current(CircleList* list) // O(1) {TCircleList* sList = (TCircleList*)list;CircleListNode* ret = NULL;if( sList != NULL ){ret = sList->slider;}return ret;}CircleListNode* CircleList_Next(CircleList* list) // O(1) {TCircleList* sList = (TCircleList*)list;CircleListNode* ret = NULL;if( (sList != NULL) && (sList->slider != NULL) ){ret = sList->slider;sList->slider = ret->next;}return ret;}Main.c 文件#include <stdio.h>#include <stdlib.h>#include "circlelist.h"typedef struct Value{CircleListNode node;int v;}Va;void main(){CircleList *circleList = NULL;circleList = CircleList_Create();Va v1, v2, v3, v4, v5, v6, v7, v8;v1.v = 1; v2.v = 2; v3.v = 3; v4.v = 4;v5.v = 5; v6.v = 6; v7.v = 7; v8.v = 8;int res;res = CircleList_Insert(circleList, (CircleListNode *)&v1, CircleList_Length(circleList));res = CircleList_Insert(circleList, (CircleListNode *)&v2, CircleList_Length(circleList));res = CircleList_Insert(circleList, (CircleListNode *)&v3, CircleList_Length(circleList));res = CircleList_Insert(circleList, (CircleListNode *)&v4, CircleList_Length(circleList));res = CircleList_Insert(circleList, (CircleListNode *)&v5, CircleList_Length(circleList));res = CircleList_Insert(circleList, (CircleListNode *)&v6, CircleList_Length(circleList));res = CircleList_Insert(circleList, (CircleListNode *)&v7, CircleList_Length(circleList));res = CircleList_Insert(circleList, (CircleListNode *)&v8, CircleList_Length(circleList));int len = CircleList_Length(circleList);for (int i = 0; i < len; i++){Va *tmp = (Va *)CircleList_Get(circleList, i);if (tmp != NULL){printf("tmp v:%d\n",tmp->v);}}CircleList_Reset(circleList);printf("\n\n");Va *tmp = NULL;while (CircleList_Length(circleList) > 0){for (int i = 1; i < 3; i++){CircleList_Next(circleList); // 让游标后移两步}tmp = (Va *)CircleList_Current(circleList); //获取游标所指的元素printf("tmp v:%d\n", tmp->v);CircleList_DeleteNode(circleList, (CircleListNode *)tmp); //删除该节点并让游标后移}//CircleList_Clear(circleList);CircleList_Destroy(circleList);system("pause");}4有一个数组a[1000]存放0-1000；要求每个二个数删除一个，到末尾是循环至开头继续进行，求最后一个被删除的数的原始下标位置#include<iostream>using namespace std;struct node{int data;node*next;};int main(){node*head=new node;head->data=0;head->next=NULL;node*p=head;//创建链表for(int i=1;i<1000;i++){node*tmp=new node;tmp->data=i;tmp->next=NULL;head->next=tmp;head=head->next;}//把链表的尾和头连上创建循环链表head->next=p;while(p!=p->next){p->next->next=p->next->next->next->next;p=p->next->next;}cout<<p->data<<endl;return0;}5 已知链两个链表head1和head2各自有序，请把他们合并一个链表依然有序，这次要求用递归方法进行typedef struct Node{int data;struct Node*next;}Node;Node*MergeRecursive(Node*head1,Node*head2){if(head1==NULL)return head2;if(head2==NULL)return head1;Node*head=NULL;if(head1->data<head2->data){head=head1;head->next=MergeRecursive(head1->next,head2);}else{head=head2;head->next=MergeRecursive(head1,head2->next);}return head;}6 如何判断一个单链表是有环的？用两个指针，一个每次递增一步，一个每次递增两步，如果有环的话两者必定重合struct node{int data;node*next;};//返回true为有环bool check(const node*head){if(head==NULL)return false;node*low=head;node*fast=head->next;while(fast!=NULL&&fast->next!=NULL){low=low->next;fast=fast->next->next;if(low==fast)return true;}return false;}7 线性表a b 为两个有序升序的线性表，编写一程序，使两个有序线性表合并成一个有序升序线性表Link *union(Linklist *p, Linklist *q){linklist *R,*pa,*qa,*ra;pa=p;qa=q;R=ra=p;while(pa->next!=NULL&&qa->next!=NULL){if(pa->data>qa->data){ra->next=qa;qa=qa->next;}else{ra->next=pa;pa=pa->next;}}if(pa->next!=NULL){ra->next=pa;}if(qa->next!=NULL){ra->next=qa;}return R; }。