-
题目描述
-
解题思路心得
就是循环遍历找最大值
-
代码
#include <iostream>
using namespace std;
struct LNode
{
int data;
LNode *next;
};
void createlist(LNode *&L, int length)
{
LNode *p = L;
for (int i = 0; i < length; i++)
{
LNode *tmp = new LNode;
cin >> tmp->data;
tmp->next = NULL;
p->next = tmp;
p = p->next;
}
}
int maxlist(LNode *L)
{
LNode *p;
int max = 0;
p = L->next;
if (p != NULL)
{
max = p->data;
}
while (p)
{
if (p->data > max)
{
max = p->data;
}
p = p->next;
}
return max;
}
int main()
{
int n = 0;
while (1)
{
LNode *LA = new LNode;
LA->next = NULL;
cin >> n;
if (!n)
{
break; /* code */
}
createlist(LA, n);
cout<<maxlist(LA)<<endl;
}
return 0;
}