题目1517：链表中倒数第k个结点

最新推荐文章于 2022-07-27 06:37:52 发布

Rabbit誩

最新推荐文章于 2022-07-27 06:37:52 发布

阅读量356

点赞数

分类专栏：九度|剑指OFFER 文章标签：链表中倒数第k个结点链表双向链表

本文链接：https://blog.csdn.net/u010911170/article/details/43836257

版权

九度|剑指OFFER 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

其实直接算链表长度-k就行了

上次写的双向链表出了问题，就再写了一次。返回尾指针即可

#include<cstdio>
#include<cstring>
#include<cstdlib>

typedef struct node
{
	int val;
	struct node *next;
	struct node *pre;
}Sqlist;
int n,k;

Sqlist *create()
{
	Sqlist *l1,*l2,*temp;
	l1 = (Sqlist *)malloc(sizeof(Sqlist));
	scanf("%d",&l1->val);
	l2 = l1;	
	for(int i=1;i<n;++i)
	{
		l1 = (Sqlist *)malloc(sizeof(Sqlist));
		scanf("%d",&l1->val);
		l2->next = l1;
		temp = l2;
		l2 = l1;
		l2->pre = temp;
	}
	return l2; //尾指针 
}

 

int main()
{
	while(scanf("%d%d",&n,&k) != EOF)
	{
	
		Sqlist *list;
		list = create();
		if(k == 0 || k > n)
		{
			printf("NULL\n");
			continue;
		}
		int count = 1;
		while(count != k)
		{
			list = list->pre;
			count++;
		}
		printf("%d\n",list->val);
	}
	return 0;
}