有这样一个结构体:
struct node{
int data;
struct node *next;
}
编写一个C函数,来判断这段链表中data的值是否是递增排列的,代码如下:
void func(ListNode *head)
{
while(head->next != NULL)
{
if(head->data < head->next->data)
head = head->next;
else
{
printf("List is not in ascending order!\n");
return 0;
}
}
}