main.cpp

查找链表中倒数第M个元素 其中包含链表原码

#include "LList.h"
#include <iostream>
using namespace std;

int main() 
{
	int i;
	int m,n;
	int value;
	LList <int> llist;												//the template contain element's type is int											
	for(i=1;i<=1000;i++)
	{
		llist.append(i);                		
	}
	n = llist.rightLength();										//get the number of totol elements
	do{
	cout << "please input a integer between 1  and "<< n <<endl;
	cin >> m;														//imput m
	}while (m<1||m>n);
	llist.setPos(n-m);												//get the last No.m fence
	llist.getValue(value);											
	cout <<"the last No."<<m<<" element is " <<value<<endl;			//output the last No.m nubmer
	return 0;
}