typedef struct
{
int data;
Node *next;
Node *prev;
}Node;
int find_max(Node *phead)
{
assert(phead != NULL);
Node *p = phead->next;
int max = p->data;
while(p->next != phead->next)
{
Node *s = p->next;
if(max < s->data)
{
max = s->data;
}
p = p->next;
}
}
链表中找最大值
最新推荐文章于 2024-06-24 19:31:02 发布