数据结构：找出链表确定值最大的节点_本题要求求出单链表值最大的结点并返回。要求实现两个函数。 函数接口定义: /* 建

#include<iostream>
using namespace std;
typedef struct LNode
{
	int data;
	struct LNode* next;
	int num;
}LNode,*LinkList;

LinkList& createList(LinkList& L, int n)     //创建链表
{
	L = new LNode;
	L->next = NULL;
	L->num = 0;
	LinkList r = L;
	for (int i = 0; i < n; i++)
	{
		LNode* p = new LNode;
		cin >> p->data;
		p->next = NULL;
		r->next = p;
		r = p;
		L->num++;
	}
	return L;
}

void showList(LinkList L)			//输出链表
{
	if (L->num == 0)
		cout << "链表为空！" << endl;
	else
	{
		int q = L->num;
		for (int i = 0; i < q; i++)
		{
			if (L->next->data != NULL)
			{
				cout << L->next->data << " ";
				L = L->next;
			}
		}
		cout << endl;
	}
}

int maxData(LinkList L)     //求链表确定值最大的节点
{
	if (L->num == 0)
		cout << "链表为空！" << endl;
	else
	{
		int max = 0xc0c0c0c0;    //先初始化max为无穷小
		int q = L->num;
		for (int i = 0; i < q; i++)
		{
			if (L->next->data != NULL)
			{
				if (L->next->data > max)
				{
					int data = L->next->data;
					int temp = data;
					data = max;
					max = temp;
					L = L->next;
				}
			}
		}
		return max;
	}
}

int main()
{
	LinkList L1;
	int n1;
	cout << "请输入单链表的长度：" << endl;
	cin >> n1;
	cout << "请输入单链表的内容：" << endl;
	L1 = createList(L1, n1);
	cout << "单链表为：" << endl;
	showList(L1);
	cout << "该链表中确定值最大的节点为：" << endl;
	cout << maxData( L1)<<endl;
	return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86