数据结构

统计链表中奇数元素的个数。

链表求奇数元素个数.jpg

分数:

请勿频繁操作

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

typedef struct _Node
{
	int data;
	struct _Node *next;
} Node, *pLink;

pLink InitCreateLink(void);
void output(pLink head);
int LinkCountOdd(pLink head, int *cnt);
void Destroy(pLink head);

int main(void)
{
	int cnt;
	pLink head = NULL;

	head = InitCreateLink();
	output(head);
	if (LinkCountOdd(head, &cnt) > 0)
	{
		printf("链表中值为奇数元素个数:%d\n", cnt);
	}
	else
	{
		printf("空链\n");
	}
	Destroy(head);
	return 0;
}

void output(pLink head)
{
	if (head == NULL || head->next == NULL)
	{
		return ;
	}
	head = head->next;
	while(head->next != NULL)
	{
		printf("%d ", head->data);
		head = head->next;
	}
	printf("%d\n", head->data);
}

pLink InitCreateLink(void)
{
	int temp;
	pLink head, p;
	pLink s;

	head = (pLink)malloc(sizeof(Node));
	if (head == NULL)
	{
		return NULL;
	}
	p = head;
	head->next = NULL;

	printf("输入链表序列（尾插法），0结束\n");
	scanf("%d", &temp);
	while (temp != 0)
	{
		s = (pLink)malloc(sizeof(Node));
		if (s == NULL)
		{
			return head;
		}
		s->data = temp;
		s->next = p->next;
		p->next = s;
		p = s;
		scanf("%d", &temp);
	}
	return head;
}

void Destroy(pLink head)
{
	pLink p;

	while (head != NULL)
	{
		p = head;
		head = head->next;
		free(p);
	}
}
/******start******/

/******end******/

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

typedef struct _Node
{
	int data;
	struct _Node *next;
} Node, *pLink;

pLink InitCreateLink(void);
void output(pLink head);
int LinkCountOdd(pLink head, int *cnt);
void Destroy(pLink head);

int main(void)
{
	int cnt;
	pLink head = NULL;

	head = InitCreateLink();
	output(head);
	if (LinkCountOdd(head, &cnt) > 0)
	{
		printf("链表中值为奇数元素个数:%d\n", cnt);
	}
	else
	{
		printf("空链\n");
	}
	Destroy(head);
	return 0;
}

void output(pLink head)
{
	if (head == NULL || head->next == NULL)
	{
		return ;
	}
	head = head->next;
	while(head->next != NULL)
	{
		printf("%d ", head->data);
		head = head->next;
	}
	printf("%d\n", head->data);
}

pLink InitCreateLink(void)
{
	int temp;
	pLink head, p;
	pLink s;

	head = (pLink)malloc(sizeof(Node));
	if (head == NULL)
	{
		return NULL;
	}
	p = head;
	head->next = NULL;

	printf("输入链表序列（尾插法），0结束\n");
	scanf("%d", &temp);
	while (temp != 0)
	{
		s = (pLink)malloc(sizeof(Node));
		if (s == NULL)
		{
			return head;
		}
		s->data = temp;
		s->next = p->next;
		p->next = s;
		p = s;
		scanf("%d", &temp);
	}
	return head;
}

void Destroy(pLink head)
{
	pLink p;

	while (head != NULL)
	{
		p = head;
		head = head->next;
		free(p);
	}
}
/******start******/

/******end******/

该程序创建一个带头结点的单链表。完成FindMin函数，找到最小值min1和次小值min2（第二小值）。

链表找2个最小值1.jpg

链表找2个最小值2.jpg

分数:

请勿频繁操作

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

typedef struct _Node
{
	int data;
	struct _Node *next;
} Node, *pLink;

pLink InitCreateLink(void);
void output(pLink head);
int FindMin(pLink head, int *min1, int *min2);
void Destroy(pLink head);

int main(void)
{
	int min1, min2;
	pLink head = NULL;

	head = InitCreateLink();
	output(head);
	if (FindMin(head, &min1, &min2) > 0)
	{
		printf("最小值=%d，次小值=%d\n", min1, min2);
	}
	else
	{
		printf("链表元素个数不足\n");
	}
	Destroy(head);
	return 0;
}

void output(pLink head)
{
	if (head == NULL || head->next == NULL)
	{
		return ;
	}
	head = head->next;
	while(head->next != NULL)
	{
		printf("%d ", head->data);
		head = head->next;
	}
	printf("%d\n", head->data);
}

pLink InitCreateLink(void)
{
	int temp;
	pLink head;
	pLink s;

	head = (pLink)malloc(sizeof(Node));
	if (head == NULL)
	{
		return NULL;
	}
	head->next = NULL;

	printf("输入链表序列（头插法），0结束\n");
	scanf("%d", &temp);
	while (temp != 0)
	{
		s = (pLink)malloc(sizeof(Node));
		if (s == NULL)
		{
			return head;
		} 
		s->data = temp;
		s->next = head->next;
		head->next = s;
		scanf("%d", &temp);
	}
	return head;
}

void Destroy(pLink head)
{
	pLink p;

	while (head != NULL)
	{
		p = head;
		head = head->next;
		free(p);
	}
}
/******start******/

/******end******/

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

typedef struct _Node
{
	int data;
	struct _Node *next;
} Node, *pLink;

pLink InitCreateLink(void);
void output(pLink head);
int FindMin(pLink head, int *min1, int *min2);
void Destroy(pLink head);

int main(void)
{
	int min1, min2;
	pLink head = NULL;

	head = InitCreateLink();
	output(head);
	if (FindMin(head, &min1, &min2) > 0)
	{
		printf("最小值=%d，次小值=%d\n", min1, min2);
	}
	else
	{
		printf("链表元素个数不足\n");
	}
	Destroy(head);
	return 0;
}

void output(pLink head)
{
	if (head == NULL || head->next == NULL)
	{
		return ;
	}
	head = head->next;
	while(head->next != NULL)
	{
		printf("%d ", head->data);
		head = head->next;
	}
	printf("%d\n", head->data);
}

pLink InitCreateLink(void)
{
	int temp;
	pLink head;
	pLink s;

	head = (pLink)malloc(sizeof(Node));
	if (head == NULL)
	{
		return NULL;
	}
	head->next = NULL;

	printf("输入链表序列（头插法），0结束\n");
	scanf("%d", &temp);
	while (temp != 0)
	{
		s = (pLink)malloc(sizeof(Node));
		if (s == NULL)
		{
			return head;
		} 
		s->data = temp;
		s->next = head->next;
		head->next = s;
		scanf("%d", &temp);
	}
	return head;
}

void Destroy(pLink head)
{
	pLink p;

	while (head != NULL)
	{
		p = head;
		head = head->next;
		free(p);
	}
}
/******start******/

/******end******/

有一带头结点的单链表。完成FindMax函数，查找该链表中最大的元素值。

链表找最大值1.jpg

链表找最大值2.jpg

分数:

请勿频繁操作

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

typedef struct _Node
{
	int data;
	struct _Node *next;
} Node, *pLink;

pLink InitCreateLink(void);
void output(pLink head); 
int FindMax(pLink head, int *max);

int main(void)
{
	int max;
	pLink head = NULL;

	head = InitCreateLink();
	output(head);
	if (FindMax(head, &max) > 0)
	{
		printf("max=%d\n", max);
	}
	else
	{
		printf("链表为空\n");
	}
	return 0;
}

void output(pLink head)
{
	if (head == NULL || head->next == NULL)
	{
		return ;
	}
	head = head->next;
	while(head->next != NULL)
	{
		printf("%d ", head->data);
		head = head->next;
	}
	printf("%d\n", head->data);
}

pLink InitCreateLink(void)
{
	int temp;
	pLink head;
	pLink s;

	head = (pLink)malloc(sizeof(Node));
	if (head == NULL)
	{
		return NULL;
	}
	head->next = NULL;

	printf("输入链表序列（头插法），0结束\n");
	scanf("%d", &temp);
	while (temp != 0)
	{
		s = (pLink)malloc(sizeof(Node));
		if (s == NULL)
		{
			return head;
		}
		s->data = temp;
		s->next = head->next;
		head->next = s;
		scanf("%d", &temp);
	}
	return head;
}

/******start******/

/******end******/

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

typedef struct _Node
{
	int data;
	struct _Node *next;
} Node, *pLink;

pLink InitCreateLink(void);
void output(pLink head); 
int FindMax(pLink head, int *max);

int main(void)
{
	int max;
	pLink head = NULL;

	head = InitCreateLink();
	output(head);
	if (FindMax(head, &max) > 0)
	{
		printf("max=%d\n", max);
	}
	else
	{
		printf("链表为空\n");
	}
	return 0;
}

void output(pLink head)
{
	if (head == NULL || head->next == NULL)
	{
		return ;
	}
	head = head->next;
	while(head->next != NULL)
	{
		printf("%d ", head->data);
		head = head->next;
	}
	printf("%d\n", head->data);
}

pLink InitCreateLink(void)
{
	int temp;
	pLink head;
	pLink s;

	head = (pLink)malloc(sizeof(Node));
	if (head == NULL)
	{
		return NULL;
	}
	head->next = NULL;

	printf("输入链表序列（头插法），0结束\n");
	scanf("%d", &temp);
	while (temp != 0)
	{
		s = (pLink)malloc(sizeof(Node));
		if (s == NULL)
		{
			return head;
		}
		s->data = temp;
		s->next = head->next;
		head->next = s;
		scanf("%d", &temp);
	}
	return head;
}

/******start******/

/******end******/

有一带头结点单链表。完成LinkSum函数，求各结点元素的和。

链表数据元素求和.jpg

分数:

请勿频繁操作

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

typedef struct _Node
{
	int data;
	struct _Node *next;
} Node, *pLink;

pLink InitCreateLink(void);
void output(pLink head);
int LinkSum(pLink head, int *sum);
void Destroy(pLink head);

int main(void)
{
	int sum;
	pLink head = NULL;

	head = InitCreateLink();
	output(head);
	if (LinkSum(head, &sum) > 0)
	{
		printf("求和值=%d\n", sum);
	}
	else
	{
		printf("空链\n");
	}
	Destroy(head);
	return 0;
}

void output(pLink head)
{
	if (head == NULL || head->next == NULL)
	{
		return ;
	}
	head = head->next;
	while(head->next != NULL)
	{
		printf("%d ", head->data);
		head = head->next;
	}
	printf("%d\n", head->data);
}

pLink InitCreateLink(void)
{
	int temp;
	pLink head;
	pLink s;

	head = (pLink)malloc(sizeof(Node));
	if (head == NULL)
	{
		return NULL;
	}
	head->next = NULL;

	printf("输入链表序列（头插法），0结束\n");
	scanf("%d", &temp);
	while (temp != 0)
	{
		s = (pLink)malloc(sizeof(Node));
		if (s == NULL)
		{
			return head;
		}
		s->data = temp;
		s->next = head->next;
		head->next = s;
		scanf("%d", &temp);
	}
	return head;
}

void Destroy(pLink head)
{
	pLink p;
	while (head != NULL)
	{
		p = head;
		head = head->next;
		free(p);
	}
}
/******start******/

/******end******/

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

typedef struct _Node
{
	int data;
	struct _Node *next;
} Node, *pLink;

pLink InitCreateLink(void);
void output(pLink head);
int LinkSum(pLink head, int *sum);
void Destroy(pLink head);

int main(void)
{
	int sum;
	pLink head = NULL;

	head = InitCreateLink();
	output(head);
	if (LinkSum(head, &sum) > 0)
	{
		printf("求和值=%d\n", sum);
	}
	else
	{
		printf("空链\n");
	}
	Destroy(head);
	return 0;
}

void output(pLink head)
{
	if (head == NULL || head->next == NULL)
	{
		return ;
	}
	head = head->next;
	while(head->next != NULL)
	{
		printf("%d ", head->data);
		head = head->next;
	}
	printf("%d\n", head->data);
}

pLink InitCreateLink(void)
{
	int temp;
	pLink head;
	pLink s;

	head = (pLink)malloc(sizeof(Node));
	if (head == NULL)
	{
		return NULL;
	}
	head->next = NULL;

	printf("输入链表序列（头插法），0结束\n");
	scanf("%d", &temp);
	while (temp != 0)
	{
		s = (pLink)malloc(sizeof(Node));
		if (s == NULL)
		{
			return head;
		}
		s->data = temp;
		s->next = head->next;
		head->next = s;
		scanf("%d", &temp);
	}
	return head;
}

void Destroy(pLink head)
{
	pLink p;
	while (head != NULL)
	{
		p = head;
		head = head->next;
		free(p);
	}
}
/******start******/

/******end******/