2.(10分)设有一个带头结点，由正整数组成的无序单链表，头指针为L。。。。。整个问题如下

Posted 2023-05-12

2.(10分)设有一个带头结点，由正整数组成的无序单链表，头指针为L，
Typedef struct Lnode
int data;
struct Lnode *next;
Lnode,*Linklist;
Linklist L;
给出完成下列功能的算法并分析算法时间复杂度：
①找出最小值结点，且打印该数值；
②若该数值是奇数，则将其与直接后继结点（若存在）的数值交换；
③若该数值是偶数，则将其直接后继结点（若存在）删除；
数据结构问题，用C解决

#include <stdio.h>
#include <stdlib.h>

typedef struct Lnode
int data;
struct Lnode *next;
Lnode,*Linklist;
Linklist L;

Linklist ListInit(Linklist Head, int n)

Linklist p;
int i;
for(i = 0; i < n; i ++)

p = (Linklist)malloc(sizeof(Lnode));
p->next = Head;
Head = p;

return Head;

Linklist ListReleas(Linklist Head)

Linklist p = Head;

while(Head)

p = Head;
Head=p->next;
free(p);

return Head;


int main()

Linklist Head = NULL, p = NULL, q = NULL;
int count[3] = 0, n, inum;
printf("输入节点数：");
scanf("%d", &n);
Head = ListInit(Head, n);

printf("输入每个节点值（共%d个）：\n", n);
p = Head;
while( p != NULL )

scanf("%d", &p->data);
p = p->next;


//找出最小值
q = Head;
p = Head;
while( p != NULL )

if(p->data < q->data)
q = p;
p = p->next;

printf("最小值为：%d\n",q->data);
//以下为第一次输出
p = Head;
while( p != NULL )

printf("%d ", p->data);
p = p->next;

printf("\n");

//奇偶判断并进行处理
if(q->data % 2)

if(q->next)

inum = q->data;
q->data = q->next->data;
q->next->data = inum;


else

while(q->next)

p = q->next;
q->next = p->next;
free(p);



//以下为修改后输出
p = Head;
while( p != NULL )

printf("%d ", p->data);
p = p->next;

printf("\n");

ListReleas(Head);

return 0;
参考技术A 链表问题大全！！！刚出炉的还热乎呢！！
#include <stdio.h>
#include <stdlib.h>

typedef struct node

int nDate;
struct node *pstnext;
Node;
//链表输出
void output(Node *head)

Node *p = head->pstnext;
while(NULL != p)

printf("%d ", p->nDate);
p = p->pstnext;

printf("\r\n");

//链表建立
Node* creat()

Node *head = NULL, *p = NULL, *s = NULL;
int Date = 0, cycle = 1;
head = (Node*)malloc(sizeof(Node));
if(NULL == head)

printf("分配内存失败\r\n");
return NULL;

head->pstnext = NULL;

p = head;
while(cycle)

printf("请输入数据且当输入数据为0时结束输入\r\n");
scanf("%d", &Date);
if(0 != Date)

s = (Node*)malloc(sizeof(Node));
if(NULL == s)

printf("分配内存失败\r\n");
return NULL;

s->nDate = Date;
p->pstnext = s;
p = s;

else

cycle = 0;


p->pstnext = NULL;
return(head);

//单链表测长
void length(Node *head)

Node *p = head->pstnext;
int j=0;
while(NULL != p)

p = p->pstnext;
j++;

printf("%d\r\n", j);

//链表按值查找
void research_Date(Node *head, int date)

Node *p;
int n=1;
p = head->pstnext;
while(NULL != p && date != p->nDate)

p = p->pstnext;
++n;

if(NULL == p)

printf("链表中没有找到该值");
else if(date == p->nDate)

printf("要查找的值%d在链表中第%d个位置\r\n", date, n);

return;

//按序号查找
void research_Number(Node *head, int Num)

Node *p=head;
int i = 0;
while(NULL != p && i < Num)

p = p->pstnext;
i++;

if(p == NULL)

printf("查找位置不合法\r\n");
else if(i == 0)

printf("查找位置为头结点\r\n");
else if(i == Num)

printf("第%d个位置数据为%d\r\n", i, p->nDate);


//在指定元素之前插入新结点
void insert_1(Node *head, int i, int Newdate)

Node *pre = head, *New = NULL;
int j = 0;
while(NULL != pre && j < i-1)

pre = pre->pstnext;
j++;

if(NULL == pre || j > i-1)

printf("插入位置不存在\r\n");
else

New = (Node*)malloc(sizeof(Node));
if(NULL == New)

printf("分配内存失败\r\n");
return;

New->nDate = Newdate;
New->pstnext = pre->pstnext;
pre->pstnext = New;



//在指定元素之后插入新结点
void insert_2(Node *head, int i, int Newdate)

Node *pre = head, *New = NULL;
int j = 0;
while(NULL != pre->pstnext && j < i)

pre = pre->pstnext;
j++;

if(j == i)

New = (Node*)malloc(sizeof(Node));
if(NULL == New)

printf("分配内存失败\r\n");
return;

New->nDate = Newdate;
New->pstnext = pre->pstnext;
pre->pstnext = New;
else

printf("插入位置不存在\r\n");


//删除第一个结点
void delete_list(Node *head)

Node *p = head->pstnext;
head->pstnext = p->pstnext;
free(p);

//删除指定结点
void Delete_1(Node *head, int i3)

Node *p = head, *pre = NULL;
int j = 0;
while(NULL != p && j < i3)

pre = p;
p = p->pstnext;
j++;

if(NULL == p)

printf("删除位置不存在\r\n");
else

pre->pstnext = p->pstnext;
free(p);


//指定删除单链表中某个数据，并统计删除此数据的个数
int Delete_2(Node *head, int Delete_date)

int count = 0;
Node *p = head, *q;
while(NULL != p->pstnext)

q = p->pstnext;
if(q->nDate == Delete_date)

p->pstnext = q->pstnext;
free(q);
++count;

else

p = q;


return count;

//链表逆置
void Reverse_list(Node *head)

Node *q, *s;
if(NULL == head->pstnext || NULL == head->pstnext->pstnext)

return;

q = head->pstnext->pstnext;
head->pstnext->pstnext = NULL;
while(NULL != q)

s = q->pstnext;
q->pstnext = head->pstnext;
head->pstnext = q;
q = s;


//单链表的连接
void connect_list(Node *head, Node *head_New)

Node *p = head;
while(NULL != p->pstnext)

p = p->pstnext;

p->pstnext = head_New->pstnext;

void main()

int date, num; //待查找数据
int i3; //指定删除元素的位置
int i1, i2, Newdate_1, Newdate_2; //待插入的新数据
int Delete_date, k; //待删除的数据与其个数
Node *Head = NULL; //定义头结点
Node *Head_New = NULL;

//链表建立
Head = creat();
printf("输出建立的单链表\r\n");
output(Head);

//单链表测长
printf("单链表长度为\r\n");
length(Head);

//链表按值查找
printf("请输入待查找的数据\r\n");
scanf("%d", &date);
research_Date(Head, date);

//链表按序号查找
printf("请输入待查找序号\r\n");
scanf("%d", &num);
research_Number(Head, num);

//在指定第i1个元素之前插入新元素Newdate
printf("在指定第i个元素之前插入新元素Newdate");
printf("请输入i与元素且以逗号间隔\r\n");
scanf("%d,%d", &i1, &Newdate_1);
insert_1(Head, i1, Newdate_1);
printf("插入后新链表\r\n");
output(Head);

//在指定第i2个元素之后插入新元素Newdate
printf("在指定第i个元素之后插入新元素Newdate");
printf("请输入i与元素且以逗号间隔\r\n");
scanf("%d,%d", &i2, &Newdate_2);
insert_2(Head, i2, Newdate_2);
printf("插入后新链表\r\n");
output(Head);

//删除链表第一个结点
delete_list(Head);
printf("输出删除后的链表\r\n");
output_list(Head);

//指定删除i3元素
printf("删除元素的位置\r\n");
scanf("%d", &i3);
Delete_1(Head, i3);
printf("删除后新链表\r\n");
output(Head);

//指定删除单链表中某个数据，并统计删除此数据的个数
printf("请输入待删除的元素\r\n");
scanf("%d", &Delete_date);
k = Delete_2(Head, Delete_date);
printf("删除后新链表\r\n");
output(Head);
printf("删除指定元素在链表中的个数为：");
printf("%d\r\n", k);

//单链表逆置
Reverse_list(Head);
printf("逆置后输出\r\n");
output(Head);

//单链表的连接
printf("建立一个新链表\r\n");
Head_New = creat();
printf("输出新链表");
output(Head);
printf("将新链表连接到原来链表的尾部并输出\r\n");
connect_list(Head, Head_New);
output(Head);
return;

2203: 最小节点(线性表)

2203: 最小节点(线性表)

时间限制: 1 Sec  内存限制: 128 MB
提交: 382  解决: 294
[提交][状态][讨论版][命题人:外部导入]

题目描述

（线性表）设有一个由正整数组成的无序（向后）单链表，编写完成下列功能的算法：找出最小值结点，且打印该数值。

输入

输入长度:6

输入数据：3 2 1 4 6 8

输出

1

样例输入

6
11 14 5 6 8 9

样例输出

5

#include<cstdio>
#include<cstdlib>
#include<iostream>
using namespace std;
#define MAXN 110
typedef int ElemType;
typedef struct LNode
{
    ElemType data;
    struct LNode * next;
}LinkNode;

ElemType a[MAXN], e;
LinkNode *L;

void CreateList(LinkNode *&L, ElemType a[], int n)
{
    LinkNode *r, *s;
    L = (LinkNode *)malloc(sizeof(LinkNode));
    r = L;
    for(int i = 0; i < n; ++i)
    {
        s = (LinkNode *)malloc(sizeof(LinkNode));
        s->data = a[i];
        r->next = s;
        r = s;
    }
    r->next = NULL;
}

void GetMin(LinkNode *L, ElemType &e)
{
    LinkNode *p = L->next, *pre = L, *minp, *minpre;
    minp = p;
    minpre = pre;
    while(p != NULL)
    {
        if(minp->data > p->data)
        {
            minp = p;
            minpre = pre;
        }
        pre = p;
        p = p->next;
    }
    e = minp->data;
    return ;
}

int main()
{
    int n;
    cin >> n;
    for(int i = 0; i < n; ++i)
        cin >> a[i];
    CreateList(L, a, n);
    GetMin(L, e);
    cout << e << endl;
    return 0;
}