careercup2.2

挺简单，两个指针差n扫描。

/*Implement an algorithm to find the nth to last element of a single linked list
*/
#include <iostream>
using namespace std;
class Node{
public:
	int data;
    Node* next;
	Node(){this->next = 0;}
	Node(int a):data(a),next(0){}
};

class LinkList{
public:
	LinkList(){ head = new Node(-1);}
	LinkList(int ar[],int len){
		head = new Node(-1);
		Node*p = FindTail();
		for(int i = 0; i<len; i++)
			insertion(ar[i]);
	}
	Node* FindTail();
	Node* head;
	void insertion(int);
	Node* del(Node* i, Node*p);
	int findn(int k);
	void print()const{
		Node* p = head->next;
		 while(p)
		{
		  cout<<p->data<<" ";
		  p = p->next;
		  }
	}
};

Node* LinkList::FindTail(){
	Node* p = head;	
	while( p->next!= 0){
		p = p->next;
	}
	return p;
}
void LinkList::insertion(int k){
	Node* p = FindTail();
	p->next = new Node(k);
}

Node* LinkList::del(Node* i,Node*p){
	p->next = i->next;
	delete(i);
	return p->next;
}

int LinkList::findn(int k){
	Node* p = head->next;
	Node* pt = p;

	for(int i = 0; i<k;i++)
		if (!p){
		  cout<<"out of the range"<<endl;
		  return -1;
		}else
			p = p->next;
	
	while(p){
		p = p->next;
		pt = pt->next;
	}
	return pt->data;
}
int main(){
	int ar[]={1,3,5,67,8,9,45,78,9,33,12,3,5,4,67,67};
	LinkList ll(ar,16);
	cout<<ll.findn(5)<<endl;
}