Implement an algorithm to find the kth to last element of a singly linked list.

CareerCup2.2.cpp

#include <iostream>
#include <string>

class Node
{
  public:
	int data;
	Node* next;
};

void Input(Node*, Node*);
void Outputkth(Node*, Node*,int);
void Del(Node*, Node*);
int main()
{
	Node *head = new Node();
	Node *end = new Node();
	Input(head,end);
	std::cout<<"Enter k please:"<<std::endl;
	int k;
	std::cin>>k;
	Outputkth(head,end,k);
	Del(head,end);
	return 0;
}

//input the linked list
void Input(Node* head, Node* end)
{
	using namespace std;
	int num;
	Node *current = head;
	while(cin>>num)
	{
		current->next = new Node();
		current = current->next;
		current->data = num;
	}
	current->next = end;
	cin.clear();
}
void Outputkth(Node* head, Node* end,int k)
{
	using namespace std;
	Node *current = head;
	Node *kth = head;
	for(int i=0;i<k;i++)
	{
		kth=kth->next;
	}
	while(kth!=end)
	{
		current = current->next;
		kth = kth->next;
	}
	while(current!=end)
	{
		cout<<current->data<<" ";
		current = current->next;
	}
	cout<<endl;
}
void Del(Node* head, Node* end)
{
	Node *current = head;
	while(current->next!=end)
	{
		Node* former = current;
		current = current->next;
		former->next = current->next;
		delete current;
		current = former;
	}

}