链表中倒数第k个结点

题目描述：输入一个单链表，输出该链表中的倒数第k个结点。

思路分析：单链表不可能回退嘛，所以就考虑用两个指针。

代码分析：

#include<iostream>
using namespace std;

struct Node
{
	int data;
	Node *next;
};

bool Insert_tail(Node *list,int value)//尾插
{
	if(list == NULL)
	{
		return false;
	}
	Node *node = new Node;
	node -> data = value;
	node ->next = NULL;
	Node *p = list;
	for(;p->next !=NULL;p=p->next );
	p->next = node;
	return true;
}

Node *FindKTotail(Node *head,int k)
{
	if(head == NULL || k<=0)
	{
		return NULL;
	}
	Node *fast = head;
	Node *last = head;
	int tmp = k;
	while(tmp>1)//fast走k步
	{
		if(fast == NULL) //小心越界
		{
			return NULL;
		}
		fast = fast->next ;
		--tmp;
	}

	while(fast->next !=NULL)//fast和last一起走
	{
		last = last->next ;
		fast = fast->next ;
	}
	return last;
}
void clear(Node **list)//清除
{
	Node *p = *list;
	for(;p!=NULL;p=p->next )
	{
			Node *q = p -> next;
			p->next = q->next;
			delete q;
	}
	delete p;
}

void Show(Node *list)//打印函数
{
	if(list == NULL)
		return;
	Node *p = list ->next;
	for(;p != NULL;p = p->next)
	{
		cout<<p->data<<" ";
	}
	cout<<endl;
}

int main()
{
	Node *head = new Node;//申请一个头结点
	head ->next = NULL;//把头结点的next域置为NULL
	int arr[] = {1,2,3,4,5};
	int lenarr = sizeof(arr)/sizeof(arr[0]);
	for(int i=0;i<lenarr;++i)
	{
		Insert_tail(head,arr[i]); //尾插
	}
	Show(head);
	Node *p1 = FindKTotail(head,0);
	if(p1)
	{
		cout<<p1->data<<" ";
	}
	Node *p2 = FindKTotail(head,1);
	if(p2)
	{
		cout<<p2->data<<" ";
	}
	Node *p3 = FindKTotail(head,-1);
	if(p3)
	{
		cout<<p3->data<<" ";
	}
	Node *p4 = FindKTotail(head,3);
	if(p4)
	{
		cout<<p4->data<<" ";
	}
	clear(&head);
	return 0;
}