/*找出一个无环单链表里面的倒数第K个元素,时间复杂度为O(n)
解决办法:用两个同步指针,第一个先走k-1步,第二个才开始走,
然后他们开始同步走,当第一个指针走到末尾的时候,第二个指针
就指向了倒数第K个元素。
*/
#include <iostream>
#include <stdlib.h>
typedef struct Node{
int data;
struct Node*next;
}Node,*linkList;
using namespace std;
int findElement(linkList l,int k){
linkList first,second;
first = second = l;
int count = 0;
while(count <k-1){
first = first->next;
count++;
}
while(first->next != NULL){
first=first->next;
second = second->next;
}
return second->data;
}
void showLink(const linkList l){
linkList p = l->next;
while(p!=NULL){
cout<<p->data<<" ";
p=p->next;
}
}
int main()
{
int n,e,k;
cout<<"链表长度:";
cin>>n;
linkList l;
l = new Node;
l->next =NULL;
cout<<"构建链表:"<<endl;
for(int i=0;i<n;i++){
cin>>e;
Node * s = new Node;
s->data =e;
s->next = l->next;
l->next =s;
}
cout<<"输入K值:"<<endl;
cin>>k;
int res = findElement(l,k);
cout<<"链表为:"<<endl;
showLink(l);
cout<<"倒数第"<<k<<"个元素是:"<<res<<endl;
return 0;
}