C++算法输出链表倒数第k个元素的代码

如下资料是关于C++算法输出链表倒数第k个元素的代码，希望能对各朋友有用处。

struct ListNode
{
int m_nKey;
};

Copyright by yuucyf. 2011.05.08
#include “stdafx.h”
#include
#include <assert.h>
using namespace std;

template
struct S_ListNode
{
T m_nKey;

S_ListNode()
{
m_pNext = NULL;
}
};

template
{
if (!psHead || !(psHead->m_pNext)) return psHead;

while (psHead)
{
    psHead = psHead->m_pNext;
    psTemp->m_pNext = psPrev;
    psPrev = psTemp;
}

return psPrev;

}

template
{
assert(nSize > 0);

assert(NULL != psHead);
psHead->m_nKey = nSize;
psRet = psHead;

while (--nSize)
{
	assert(NULL != psTemp);
	psTemp->m_nKey = nSize;

	psHead->m_pNext = psTemp;
	psHead = psHead->m_pNext;
}