typedef struct node
{
int data, freq;
struct node *next, *front;
} LNode, *LinkList;
int Searchk(LinkList list, int k)
{
LNode *p = list->next;
int n, cnt = count(list), i = 0;
if (k > cnt)
{
return 0;
}
n = cnt - k;
while (i <= n)
{
p = p->next;
i++;
}
printf("%d", p->data);
return 1;
}
int count(LinkList list)
{
LNode *p = list->next;
int cnt;
while (p)
{
cnt++;
p = p->next;
}
return cnt;
}
打印输出带头节点的单链表中倒数第K个位置的值
最新推荐文章于 2022-09-22 11:48:13 发布